A compact encoding of pseudo-boolean constraints into SAT

Authors:
Steffen Hölldobler;Norbert Manthey;Peter Steinke
Affiliations:
Knowledge Representation and Reasoning Group, Technische Universität Dresden, Dresden, Germany;Knowledge Representation and Reasoning Group, Technische Universität Dresden, Dresden, Germany;Knowledge Representation and Reasoning Group, Technische Universität Dresden, Dresden, Germany
Venue:
KI'12 Proceedings of the 35th Annual German conference on Advances in Artificial Intelligence
Year:
2012

Citing 15
Cited 0

A Structure-preserving Clause Form Translation

Journal of Symbolic Computation
GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
Symbolic model checking using SAT procedures instead of BDDs

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
A machine program for theorem-proving

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Principles of Constraint Programming

Principles of Constraint Programming
Industrial Strength SAT-based Alignability Algorithm for Hardware Equivalence Verification

FMCAD '07 Proceedings of the Formal Methods in Computer Aided Design
Cardinality Networks and Their Applications

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
New Encodings of Pseudo-Boolean Constraints into CNF

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Minimizing Learned Clauses

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
SATzilla: portfolio-based algorithm selection for SAT

Journal of Artificial Intelligence Research
Attacking Bivium using SAT solvers

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
BDDs for pseudo-boolean constraints: revisited

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Effective preprocessing in SAT through variable and clause elimination

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Solving periodic event scheduling problems with SAT

IEA/AIE'12 Proceedings of the 25th international conference on Industrial Engineering and Other Applications of Applied Intelligent Systems: advanced research in applied artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many different encodings for pseudo-Boolean constraints into 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 formula in conjunctive normal form that is linear in size with respect to the number of input variables. Experimental data confirms the advantages of the encoding over existing ones for most of the relevant pseudo-Boolean instances.