Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
On selecting a satisfying truth assignment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
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
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
A machine program for theorem-proving
Communications of the ACM
A Treshold for Unsatisfiability
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Mick gets some (the odds are on his side) (satisfiability)
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
We study how propositional satisfiability (SAT) problems can be reformulated as constraint satisfaction problems (CSPs). We analyse four different mappings of SAT problems into CSPs. For each mapping, we compare theoretically the performance of systematic algorithms like FC and MAC applied to the encoding against the Davis-Putnam procedure applied to the original SAT problem. We also compare local search methods like GSAT and WalkSAT on a SAT problem against the Min-Conflicts procedure applied to its encoding. Finally, we look at the special case of local search methods applied to 2-SAT problems and encodings of 2-SAT problems. Our results provide insight into the relationship between propositional satisfiability and constraint satisfaction, as well as some of the potential benefits of reformulating problems as constraint satisfaction problems.