We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Suppose that you have a set defined as: x | x >= 0 & f(x) <= 0
x | x >= 0 & f(x) <= 0
with dom(f) = {x | x >= 0}, this implies f(x) cannot be computed if x >= 0. A first idea was to compute a distance as
dom(f) = {x | x >= 0}
x >= 0
if x < 0 abs(x) else max(f(x), 0) end
This can result in consistency issues (still haven't formally written down how it appears)
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Suppose that you have a set defined as:
x | x >= 0 & f(x) <= 0
with
dom(f) = {x | x >= 0}
, this implies f(x) cannot be computed ifx >= 0
.A first idea was to compute a distance as
This can result in consistency issues (still haven't formally written down how it appears)
The text was updated successfully, but these errors were encountered: