Artificial Intelligence
Artificial Intelligence
Readings in nonmonotonic reasoning
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Synthesizing constraint expressions
Communications of the ACM
Hard problems for CSP Algorithms
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Resolution Complexity of Random Constraints
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Non Binary CSPs and Heuristics for Modeling and Diagnosing Dynamic Systems
AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Efficient SAT Techniques for Relative Encoding of Permutations with Constraints
AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
MUST: provide a finer-grained explanation of unsatisfiability
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Autonomous dynamic reconfiguration in multi-agent systems: improving the quality and efficiency of collaborative problem solving
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 2
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
Solving constraint satisfaction problems using finite state automata
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Inference-based constraint satisfaction supports explanation
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Generating combinatorial test cases by efficient SAT encodings suitable for CDCL SAT solvers
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Compiling finite linear CSP into SAT
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
A boolean encoding including SAT and n-ary CSPs
AIMSA'06 Proceedings of the 12th international conference on Artificial Intelligence: methodology, Systems, and Applications
Automatic formal verification of multithreaded pipelined microprocessors
Proceedings of the International Conference on Computer-Aided Design
Dealing with Satisfiability and n-ary CSPs in a Logical Framework
Journal of Automated Reasoning
Solving constraint satisfaction problems with SAT technology
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Azucar: a SAT-based CSP solver using compact order encoding
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Local consistency and SAT-solvers
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
A fundamental problem for most AI problem solvers is how to control search to avoid searching subspaces which previously have been determined to be inconsistent. Two of the standard approaches to this problem are embodied in the constraint satisfaction problem (CSP) techniques which evolved from vision tasks and assumption-based truth maintenance system (ATMS) techniques which evolved from applying constraint propagation techniques to reasoning about the physical world. This paper argues that both approaches embody similar intuitions for avoiding thrashing and shows how CSPs can be mapped to ATMS problems and vice versa. In particular, Mackworth's notions of node, arc, and path consistency, Freuder's notion of it-consistency, and Dechter and Pearl's notion of directed K-consistency have precise analogs in the ATMS framework.