Results 1  10
of
119
Translating pseudoboolean constraints into SAT
 Journal on Satisfiability, Boolean Modeling and Computation
, 2006
"... In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be handled by a standard SATsolver. We show that by applying a proper mix of translation techniques, a SATsolver can perfor ..."
Abstract

Cited by 185 (2 self)
 Add to MetaCart
perform on a par with the best existing native pseudoboolean solvers. This is particularly valuable in those cases where the constraint problem of interest is naturally expressed as a SAT problem, except for a handful of constraints. Translating those constraints to get a pure clausal problem will take
Optimal Base Encodings for PseudoBoolean Constraints ⋆
"... Abstract. This paper formalizes the optimal base problem, presents an algorithm to solve it, and describes its application to the encoding of PseudoBoolean constraints to SAT. We demonstrate the impact of integrating our algorithm within the PseudoBoolean constraint solver MiniSat +. Experimentati ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. This paper formalizes the optimal base problem, presents an algorithm to solve it, and describes its application to the encoding of PseudoBoolean constraints to SAT. We demonstrate the impact of integrating our algorithm within the PseudoBoolean constraint solver Mini
A New Look at BDDs for PseudoBoolean Constraints
"... PseudoBoolean constraints are omnipresent in practical applications, and thus a significant effort has been devoted to the development of good SAT encoding techniques for them. Some of these encodings first construct a Binary Decision Diagram (BDD) for the constraint, and then encode the BDD into a ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
PseudoBoolean constraints are omnipresent in practical applications, and thus a significant effort has been devoted to the development of good SAT encoding techniques for them. Some of these encodings first construct a Binary Decision Diagram (BDD) for the constraint, and then encode the BDD
New Encodings of PseudoBoolean Constraints into CNF
 12th International Conference on Theory and Applications of Satisfiability Testing, SAT ’09, volume 5584 of Lecture Notes in Computer Science
, 2009
"... The original publication is available at www.springerlink.com. Abstract. This paper answers affirmatively the open question of the existence of a polynomial size CNF encoding of pseudoBoolean (PB) constraints such that generalized arc consistency (GAC) is maintained through unit propagation (UP). A ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
The original publication is available at www.springerlink.com. Abstract. This paper answers affirmatively the open question of the existence of a polynomial size CNF encoding of pseudoBoolean (PB) constraints such that generalized arc consistency (GAC) is maintained through unit propagation (UP
A Fast PseudoBoolean Constraint Solver
, 2003
"... Linear PseudoBoolean (LPB) constraints denote inequalities between arithmetic sums of weighted Boolean functions and provide a significant extension of the modeling power of purely propositional constraints. They can be used to compactly describe many discrete EDA problems with constraints on linea ..."
Abstract

Cited by 115 (1 self)
 Add to MetaCart
Linear PseudoBoolean (LPB) constraints denote inequalities between arithmetic sums of weighted Boolean functions and provide a significant extension of the modeling power of purely propositional constraints. They can be used to compactly describe many discrete EDA problems with constraints
Representing Boolean functions as linear pseudoBoolean constraints
, 2006
"... Abstract. A linear pseudoBoolean constraint (LPB) is an expression of the form a1 ·l1 +...+am ·lm ≥ d, where each li is a literal (it assumes the value 1 or 0 depending on whether a propositional variable xi is true or false) and the a1,..., am, d are natural numbers. The formalism can be viewed as ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. A linear pseudoBoolean constraint (LPB) is an expression of the form a1 ·l1 +...+am ·lm ≥ d, where each li is a literal (it assumes the value 1 or 0 depending on whether a propositional variable xi is true or false) and the a1,..., am, d are natural numbers. The formalism can be viewed
Randomised Backtracking for Linear PseudoBoolean Constraint Problems
, 2002
"... Many constraint satisfaction and optimisation problems can be expressed using linear constraints on pseudoBoolean (0/1) variables. Problems expressed in this form are usually solved by integer programming techniques, but good results have also been obtained using generalisations of SAT algorithm ..."
Abstract

Cited by 24 (9 self)
 Add to MetaCart
Many constraint satisfaction and optimisation problems can be expressed using linear constraints on pseudoBoolean (0/1) variables. Problems expressed in this form are usually solved by integer programming techniques, but good results have also been obtained using generalisations of SAT
Research Note A Translation of PseudoBoolean Constraints to SAT
"... This paper introduces a new CNF encoding of pseudoBoolean 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 pseudoBo ..."
Abstract
 Add to MetaCart
This paper introduces a new CNF encoding of pseudoBoolean 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 pseudoBoolean
Compiling PseudoBoolean Constraints to SAT with Order Encoding
, 2013
"... Outline of this talk We implemented a PseudoBoolean (PB for short) solver named PBSugar by applying the order encoding technique to PB constraints. Contents Order encoding Original version ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Outline of this talk We implemented a PseudoBoolean (PB for short) solver named PBSugar by applying the order encoding technique to PB constraints. Contents Order encoding Original version
Solution and Optimization of Systems of PseudoBoolean Constraints
, 2007
"... Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, and so forth. Further uses are complicated by the need to express “counting constraints” in conjunctive normal form (CNF). Expressing su ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
such constraints by pure CNF leads to more complex SAT instances. Alternatively, those constraints can be handled by Integer Linear Programming (ILP), but generic ILP solvers may ignore the Boolean nature of 01 variables. Therefore, specialized 01 ILP solvers extend SAT solvers to handle these socalled “pseudoBoolean
Results 1  10
of
119