A Compact Encoding of Pseudo-Boolean Constraints into SAT
نویسندگان
چکیده
Many different encodings for pseudo-Boolean constraints to the Boolean satisfiability problem have been proposed in the past. In this work we present a novel small sized and simple to implement encoding. The encoding maintains generalized arc consistency by unit propagation and results in a linear sized formula in conjunctive normal form with respect to the number of input variables. Experimental data confirms the advantages of the encoding over existing ones for most of the relevant PB instances.
منابع مشابه
A Family of Encodings for Translating Pseudo-Boolean Constraints into SAT
A Pseudo-Boolean constraint, PB-constraint, is a linear constraint over Boolean variables. This kind of constraints has been widely used in expressing NP-complete problems. This paper introduces a family of algorithms for translating PseudoBoolean constraints into CNF clauses. These algorithms are centered around the idea of rewriting a PB-constraint as the conjunction of a set of easier to tra...
متن کاملTranslating Pseudo-Boolean Constraints into CNF
A Pseudo-Boolean constraint is a linear constraint over Boolean variables. This kind of constraints has been widely used in expressing NP-complete problems. This paper introduces a new algorithm for translating Pseudo-Boolean constraints into CNF clauses. The CNF produced by the proposed encoding has small size, and we also characterize the constraints for which one can expect the SAT solvers t...
متن کاملGeneralized Totalizer Encoding for Pseudo-Boolean Constraints
Pseudo-Boolean constraints, also known as 0-1 Integer Linear Constraints, are used to model many real-world problems. A common approach to solve these constraints is to encode them into a SAT formula. The runtime of the SAT solver on such formula is sensitive to the manner in which the given pseudo-Boolean constraints are encoded. In this paper, we propose generalized Totalizer encoding (GTE), ...
متن کاملA Verified Decision Procedure for Pseudo-Boolean Formulas
Pseudo-Boolean formulas consist of constraints of the form ∑i=1 wi · xi k, where xi are propositional literals, wi ∈ Z, k ∈ Z, and arise in planning, scheduling and optimization problems. We describe an efficient and easily verifiable decision procedure for pseudo-Boolean formulas, that is based on encoding PB formulas into the propositional satisfiability problem with the cutting-edge sequenti...
متن کاملA Translation of Pseudo Boolean Constraints to SAT
This paper introduces a new CNF encoding of pseudo-Boolean constraints, which allows unit propagation to maintain generalized arc consistency. In the worst case, the size of the produced formula can be exponentially related to the size of the input constraint, but some important classes of pseudo-Boolean constraints, including Boolean cardinality constraints, are encoded in polynomial time and ...
متن کامل