Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
On the conversion between non-binary constraint satisfaction problems
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A generic customizable framework for inverse local consistency
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
CPlan: a constraint programming approach to planning
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
On the Forward Checking Algorithm
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Dynamic Variable Ordering in CSPs
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
On Forward Checking for Non-binary Constraint Satisfaction
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Forward Checking with Backmarking
Constraint Processing, Selected Papers
Journal of Artificial Intelligence Research
Domain filtering can degrade intelligent backtracking search
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Neighborhood inverse consistency preprocessing
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Heuristic techniques for variable and value ordering in CSPs
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Journal of Artificial Intelligence Research
Complexity analysis of heuristic CSP search algorithms
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
| Hi-index | 0.00 |
Among backtracking based algorithms for constraint satisfaction problems (CSPs), algorithms employing constraint propagation, like forward checking (FC) and MAC, have had the most practical impact. These algorithms use constraint propagation during search to prune inconsistent values from the domains of the uninstantiated variables. In this paper we present a general approach to extending constraint propagating algorithms, especially forward checking. In particular, we provide a simple yet flexible mechanism for pruning domain values, and show that with this in place it becomes easy to utilize new mechanisms for detecting inconsistent values during search. This leads to a powerful and uniform technique for designing new CSP algorithms: one simply need design new methods for detecting inconsistent values and then interface them with the domain pruning mechanism. Furthermore, we also show that algorithms following this design can proved to be correct in a simple and uniform way. To demonstrate the utility of these ideas five "new" CSP algorithms are presented.