Efficient symmetry breaking for boolean satisfiability

Authors:
Fadi A. Aloul;Karem A. Sakallah;Igor L. Markov
Affiliations:
Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI;Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI;Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI
Venue:
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Year:
2003

Citing 9
Cited 15

Hard examples for resolution

Journal of the ACM (JACM)
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 comparative study of two Boolean formulations of FPGA detailed routing constraints

Proceedings of the 2001 international symposium on Physical design
Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW

Proceedings of the 38th annual Design Automation Conference
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Solving difficult SAT instances in the presence of symmetry

Proceedings of the 39th annual Design Automation Conference
BerkMin: A Fast and Robust Sat-Solver

Proceedings of the conference on Design, automation and test in Europe
Combinational test generation using satisfiability

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Breaking Instance-Independent Symmetries in Exact Graph Coloring

Proceedings of the conference on Design, automation and test in Europe - Volume 1
Exploiting structure in symmetry detection for CNF

Proceedings of the 41st annual Design Automation Conference
Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction

Constraints
The state of SAT

Discrete Applied Mathematics
Generating effective symmetry-breaking predicates for search problems

Discrete Applied Mathematics
Visualizing SAT Instances and Runs of the DPLL Algorithm

Journal of Automated Reasoning
Imitative Reinforcement Learning for Soccer Playing Robots

RoboCup 2006: Robot Soccer World Cup X
Symmetry Breaking for Maximum Satisfiability

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Dynamic Symmetry Breaking by Simulating Zykov Contraction

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
An efficient way of breaking value symmetries

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Breaking instance-independent symmetries in exact graph coloring

Journal of Artificial Intelligence Research
Dynamic symmetry-breaking for Boolean satisfiability

Annals of Mathematics and Artificial Intelligence
General symmetry breaking constraints

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Symmetry and satisfiability: an update

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Automatically exploiting symmetries in constraint programming

CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

Identifying and breaking the symmetries of CNF formulae has been shown to lead to significant reductions in search times. In this paper we describe a more systematic and efficient construction of symmetry-breaking predicates (SBPs). In particular, we use the cycle structure of symmetry generators, which typically involve very few variables, to drastically reduce the size of SBPs. Furthermore, our new SBP construction grows linearly with the number of relevant variables as opposed to the previous quadratic constructions. Our empirical data suggest that these improvements reduce search run times by one to two orders of magnitude on a wide variety of benchmarks with symmetries.