Reformulating Propositional Satissability as Constraint Satisfaction
نویسنده
چکیده
We study how propositional satissability (SAT) problems can be reformulated as constraint satisfaction problems (CSPs). We analyse four diierent 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-Connicts 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 satissability and constraint satisfaction, as well as some of the potential beneets of reformulating problems as constraint satisfaction problems.
منابع مشابه
Reformulating Propositional Satisfiability as Constraint Satisfaction
We study how propositional satissability (SAT) problems can be reformulated as constraint satisfaction problems (CSPs). We analyse four diierent 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 loc...
متن کاملSAT v CSP
We perform a comprehensive study of mappings between constraint satisfaction problems (CSPs) and propositional satissability (SAT). We analyse four diierent 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 ...
متن کاملBucket Elimination: a Unifying Framework for Structure-driven Inference
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many complex problem-solving and reasoning tasks. Algorithms such as directional-resolution for proposi-tional satissability, adaptive-consistency for constraint satisfaction, Fourier and Gaussian elimination, for solving linear equalities and inequalities and dynamic programming for combinatorial...
متن کاملSpecifying Latin Square Problems in Propositional Logic
This chapter discusses how to specify various Latin squares so that their existence can be eeciently decided by computer programs. The computer programs considered here are so-called general-purpose model generation programs (or simply model generators) that are used to solve constraint satisfaction problems in AI, to prove theorems in nite domains, or to produce counterexamples to false conjec...
متن کاملInference in Inheritance Networks using Propositional Logic and Constraint Networks Techniques
It's not my default: The complexity of membership problems in restricted propositional default logics. In AAAI-90: Proceedings of the 8th national conference on artiicial intelligence, Figure 4: Interaction graph for the theory presented in example 4.6 when the constraint graph is a tree, satissability can be determined in linear time. In Ben-Eliyahu and Dechter, 1991a] we have demonstrated the...
متن کامل