-
Notifications
You must be signed in to change notification settings - Fork 3.9k
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
added csp, logic, planning and probability .ipynb #1130
Conversation
Changed queue to set in AC3 (as in the pseudocode of the original algorithm) to reduce the number of consistency-check due to the redundancy of the same arcs in queue. For example, on the harder1 configuration of the Sudoku CSP the number consistency-check has been reduced from 40464 to 12562!
AC3 algorithm has non-optimal worst case time-complexity O(cd^3 ), while AC4 algorithm runs in O(cd^2) worst case time
…he constant propagation algorithm in mac inference
…eady present in test_csp.py
This reverts commit 20ab0e5.
This reverts commit f743146.
This reverts commit 9e0fa55.
… are already present in test_csp.py" This reverts commit b3cd24c.
…oosing the constant propagation algorithm in mac inference" This reverts commit 6986247.
This reverts commit 03551fb.
This reverts commit 93af259.
This reverts commit 6641c2c.
This reverts commit 9d37ae0.
I am a bit confused, what is the purpose of this PR? It seems that (mostly) the aforementioned notebooks are broken up into smaller ones. Do I understand correctly? Viewing all these files individually is going to be time-consuming. |
This PR aims to add many other details and comparing, for example, about all the arc consistency algorithms available in csp.py (AC3, AC4, AC3b, etc.) giving details about the performance of each of them or, again, about all the classical planning approaches (as SAT, as CSP, as forward or backward search, etc.) giving, even here, details about the performance. |
No description provided.