-
Notifications
You must be signed in to change notification settings - Fork 132
New issue
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
clpfd: incompleteness #662
Comments
... and why the unnecessary internal non-determinism? |
Cost: 2318mim |
Here is a simpler test case that exhibits the problem: ?- F = 1, F in -3..1, X #= Y mod F. F = 1, X = 0, clpz:(Y in inf..sup) ; false. But a generalization fails (using ?- * This problem was introduced with triska/clpz@cf8db7e. @notoria, since you have already made excellent contributions via various considerations involving stronger (and correct) bounds, are you interested in taking a look? I would strongly appreciate your input in this area, since I easily introduce wrong computations in this propagator. The challenge here is to have correct, strong and fast propagation for common cases involving |
Regarding the non-determinism, many goals that ought to succeed deterministically are currently not deterministic, most notably involving the frequently used ?- maplist(=(a), [X]). X = a ; false. At least for |
Yes, this is an interesting challenge. I will look into it. |
And thus testing is less effective. |
This is a new implementation for |
Please put it into the masterbranch. |
The change is too big to go in master, it might take some time to get it merged. |
?? |
Anyway, so I will test, if this is merged. |
What is it?
For your consolation: Same with clpz in SICStus 4.4.1. (Native SICStus is OK here)
The text was updated successfully, but these errors were encountered: