An optimal k-consistency algorithm
Artificial Intelligence
The logic of constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
How to solve the Zebra problem, or path consistency the easy way
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Compiling rules from constraint-based experience
International Journal of Expert Systems - Special issue: constraint reasoning for expert systems
A debugging assistant for incompletely specified constraint network knowledge bases
International Journal of Expert Systems - Special issue: constraint reasoning for expert systems
Synthesizing constraint expressions
Communications of the ACM
Local and Global Relational Consistency
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
A comparison of ATMS and CSP techniques
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Generalizing inconsistency learning for constraint satisfaction
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
IEEE Intelligent Systems
A Hybrid Method for the Planning and Scheduling
Constraints
Relaxations for Compiled Over-Constrained Problems
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Representative explanations for over-constrained problems
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Solving difficult SAT instances using greedy clique decomposition
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
A reformulation-based approach to explanation in constraint satisfaction
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Hi-index | 0.00 |
Constraint satisfaction problems are typically solved using search, augmented by general purpose consistency inference methods. This paper proposes a paradigm shift in which inference is used as the primary problem solving method, and attention is focused on special purpose, domain specific inference methods. While we expect this approach to have computational advantages, we emphasize here the advantages of a solution method that is more congenial to human thought processes. Specifically we use inference-based constraint satisfaction to support explanations of the problem solving behavior that are considerably more meaningful than a trace of a search process would be. Logic puzzles are used as a case study. Inference-based constraint satisfaction proves surprisingly powerful and easily extensible in this domain. Problems drawn from commercial logic puzzle booklets are used for evaluation. Explanations are produced that compare well with the explanations provided by these booklets.