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
Encodings of non-binary constraint satisfaction problems
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
A machine program for theorem-proving
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Some Remarks on Boolean Constraint Propagation
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
On Forward Checking for Non-binary Constraint Satisfaction
CP '99 Proceedings of the 5th 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
Constraint Programming Lessons Learned from Crossword Puzzles
AI '01 Proceedings of the 14th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
Characterizing SAT Problems with the Row Convexity Property
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
From High Girth Graphs to Hard Instances
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Interleaved Alldifferent Constraints: CSP vs. SAT Approaches
AIMSA '08 Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications
Sequential Encodings from Max-CSP into Partial Max-SAT
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Combining Satisfiability Solving and Heuristics to Constrained Combinatorial Interaction Testing
TAP '09 Proceedings of the 3rd International Conference on Tests and Proofs
SAT Encoding and CSP Reduction for Interconnected Alldiff Constraints
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
A translational approach to constraint answer set solving
Theory and Practice of Logic Programming
Knowledge Compilation Using Interval Automata and Applications to Planning
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
A complete multi-valued SAT solver
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Local consistency and SAT-solvers
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Exact DFA identification using SAT solvers
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
A SAT-based Method for Solving the Two-dimensional Strip Packing Problem
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
SampleSearch: Importance sampling in presence of determinism
Artificial Intelligence
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
Artificial Intelligence Review
Lookahead in smodels compared to local consistencies in CSP
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Towards an efficient SAT encoding for temporal reasoning
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Parallel resolution of the satisfiability problem (SAT) with OpenMP and MPI
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
A hybrid BDD and SAT finite domain constraint solver
PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
Mapping problems with finite-domain variables to problems with boolean variables
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
A boolean encoding including SAT and n-ary CSPs
AIMSA'06 Proceedings of the 12th international conference on Artificial Intelligence: methodology, Systems, and Applications
Dealing with Satisfiability and n-ary CSPs in a Logical Framework
Journal of Automated Reasoning
Programming for modular reconfigurable robots
Programming and Computing Software
A system for solving constraint satisfaction problems with SMT
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Conflict-Directed a* search for soft constraints
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Solving constraint satisfaction problems with SAT technology
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Translation-based constraint answer set solving
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Restoring CSP Satisfiability with MaxSAT
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
An algorithm for generating t-wise covering arrays from large feature models
Proceedings of the 16th International Software Product Line Conference - Volume 1
ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming
An empirical study of encodings for group MaxSAT
Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
Local consistency and SAT-solvers
Journal of Artificial Intelligence Research
International Journal of Advanced Intelligence Paradigms
Software model synthesis using satisfiability solvers
Empirical Software Engineering
A SAT approach to clique-width
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Scarab: a rapid prototyping tool for SAT-based constraint programming systems
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Towards a knowledge compilation map for heterogeneous representation languages
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Argumentation frameworks as constraint satisfaction problems
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
We perform a comprehensive study of mappings between constraint satisfaction problems (CSPs) and propositional satisfiability (SAT). We analyse four different mappings of SAT problems into CSPs, and two of CSPs into SAT problems. For each mapping, we compare the impact of achieving arc-consistency on the CSP with unit propagation on the SAT problem. We then extend these results to CSP algorithms that maintain (some level of) arc-consistency during search like FC and MAC, and to the Davis-Putnam procedure (which performs unit propagation at each search node). Because of differences in the branching structure of their search, a result showing the dominance of achieving arc-consistency on the CSP over unit propagation on the SAT problem does not necessarily translate to the dominance of MAC over the Davis-Putnam procedure. These results provide insight into the relationship between propositional satisfiability and constraint satisfaction.