Using Problem Symmetry in Search Based Satisfiability Algorithms

Authors:
E. Goldberg;M. Prasad;R. Brayton
Affiliations:
Cadence Berkeley Laboratories, Berkeley, CA;Fujitsu Labs. of America, Sunnyvale, CA;Dept. of EECS, University of California, Berkeley
Venue:
Proceedings of the conference on Design, automation and test in Europe
Year:
2002

Citing 0
Cited 5

Efficient SAT solving: beyond supercubes

Proceedings of the 42nd annual Design Automation Conference
Integration of supercubing and learning in a SAT solver

Proceedings of the 2005 Asia and South Pacific Design Automation Conference
B-Cubing: New Possibilities for Efficient SAT-Solving

IEEE Transactions on Computers
Boundary Points and Resolution

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Local lemma: a new strategy of pruning in SAT solvers

Proceedings of the 2010 ACM Symposium on Applied Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the notion of problem symmetry in search-basedSAT algorithms. We develop a theory of essentialpoints to formally characterize the potential search-spacepruning that can be realized by exploiting problem symmetry.We unify several search-pruning techniques used inmodern SAT solvers under a single framework, by showingthem to be special cases of the general theory of essentialpoints. We also propose a new pruning rule exploitingproblem symmetry. Preliminary experimental results validatethe efficacy of this rule in providing additional search-spacepruning beyond the pruning realized by techniquesimplemented in leading-edge SAT solvers.