Propagation in CSP and SAT
نویسندگان
چکیده
Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importance in both frameworks is that of constraint propagation. In this paper we study and compare the amount of propagation that can be achieved, using various methods, when translating a problem from one framework into another. Our results complement, extend, and tie together recent similar studies. We provide insight as to which translation is preferable, with respect to the strength of propagation in the original problem and the encodings.
منابع مشابه
The Extended Literal Encoding of SAT into CSP
We introduce the “extended literal” encoding of SAT into CSP. This is the first encoding which is “propagation-optimal”. That is, propagation using the standard search algorithm MAC in the CSP encoding performs the same search as Davis Putnam on the original SAT instance, and does so in the same worst case time complexity. We provide theoretical analysis of the encoding and a sample implementation
متن کامل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 ...
متن کاملModeling Choices in Quasigroup Completion: SAT vs. CSP
We perform a systematic comparison of SAT and CSP models for a challenging combinatorial problem, quasigroup completion (QCP). Our empirical results clearly indicate the superiority of the 3D SAT encoding (Kautz et al. 2001), with various solvers, over other SAT and CSP models. We propose a partial explanation of the observed performance. Analytically, we focus on the relative conciseness of th...
متن کاملInterleaved Alldifferent Constraints: CSP vs. SAT Approaches
In this paper, we want to handle multiple interleaved Alldiff constraints from two points of view: a uniform propagation framework with some CSP reduction rules and a SAT encoding of these rules that preserves the reduction properties of CSP.
متن کاملThe Effect of Nogood Recording in MAC-CBJ SAT Algorithms
Propositional Satisfiability (SAT) solvers have been the subject of remarkable improvements in the last few years. Currently, the most successful SAT solvers share a number of similarities, being based on backtrack search, applying unit propagation, and incorporating a number of additional search reduction techniques. Most, if not all, of the search reduction techniques used by state-of-the-art...
متن کاملManaging Multiple Alldifferent Constraints in CSP and SAT
Combinatorial problems are generally modeled as constraint satisfaction problems (CSP) or Boolean satisfiability problem (SAT). Modeling and resolution of CSP is often strenghtened by global constraints (e.g., Alldiff constraint) whereas no such high level feature is offered in SAT. In this paper, we propose a uniform propagation framework to handle Alldiff constraints (possibly interleaved) wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006