Fast set bounds propagation using a BDD-SAT hybrid

Authors:
Graeme Gange;Peter J. Stuckey;Vitaly Lagoon
Affiliations:
National ICT Australia, Victoria Laboratory, Department of Computer Science and Software Engineering, The University of Melbourne, Vic, Australia;National ICT Australia, Victoria Laboratory, Department of Computer Science and Software Engineering, The University of Melbourne, Vic, Australia;Cadence Design Systems, Chelmsford, MA
Venue:
Journal of Artificial Intelligence Research
Year:
2010

Citing 15
Cited 7

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
A machine program for theorem-proving

Communications of the ACM
Checking satisfiability of a conjunction of BDDs

Proceedings of the 40th annual Design Automation Conference
Symmetry Breaking Revisited

Constraints
Cardinal: A Finite Sets Constraint Solver

Constraints
Maintaining Generalized Arc Consistency on Ad Hoc r-Ary Constraints

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Propagation via lazy clause generation

Constraints
Fast Set Bounds Propagation using BDDs

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Length-lex ordering for set CSPs

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Solving set constraint satisfaction problems using ROBDDs

Journal of Artificial Intelligence Research
Propagation = lazy clause generation

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Efficient reasoning for nogoods in constraint solvers with BDDs

PADL'08 Proceedings of the 10th international conference on Practical aspects of declarative languages
Evaluation of length-lex set variables

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
A hybrid BDD and SAT finite domain constraint solver

PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
Set bounds and (split) set domain propagation using ROBDDs

AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence

Exponential propagation for set variables

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Enforcing confidentiality and data visibility constraints: an OBDD approach

DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
Lazy clause generation: combining the power of SAT and CP (and MIP?) solving

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Symmetry breaking via LexLeader feasibility checkers

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Explaining propagators for s-DNNF circuits

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Explaining alldifferent

ACSC '12 Proceedings of the Thirty-fifth Australasian Computer Science Conference - Volume 122
An OBDD approach to enforce confidentiality and visibility constraints in data publishing

Journal of Computer Security - DBSec 2011

Quantified Score

Hi-index	0.00

Visualization

Abstract

Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the significant overhead of constructing and manipulating graphs during search. We present a set-constraint solver which combines BDD-based set-bounds propagators with the learning abilities of a modern SAT solver. Together with a number of improvements beyond the basic algorithm, this solver is highly competitive with existing propagation based set constraint solvers.