ABSTRACT
Boolean satisfiability (SAT) solvers have experienced dramatic improvements in their performance and scalability over the last several years [5, 7] and are now routinely used in diverse EDA applications. Nevertheless, a number of practical SAT instances remain difficult to solve [9] and continue to defy even the best available SAT solvers [5, 7]. Recent work pointed out that symmetries in the Boolean search space are often to blame. A theoretical framework for detecting and breaking such symmetries was introduced in [2]. This framework was subsequently extended, refined, and empirically shown to yield significant speed-ups for a large number of benchmark classes in [1].Symmetries in the search space are broken by adding appropriate symmetry-breaking predicates (SBPs) to a SAT instance in conjunctive normal form (CNF). The SBPs prune the search space by acting as a filter that confines the search to non-symmetric regions of the space without affecting the satisfiability of the CNF formula. For symmetry breaking to be effective in practice, the computational overhead of generating and manipulating the SBPs must be significantly less than the run time savings they yield due to search space pruning. In this paper we present several new constructions of SBPs that improve on previous work. Specifically, we give a linear-sized CNF formula that selects lex-leaders (among others) for single permutations. We also show how that formula can be simplified by taking advantage of the sparsity of permutations. We test these improvements against earlier constructions and show that they yield smaller SBPs and lead to run time reductions on many benchmarks.
- F. Aloul, A. Ramani, I. Markov, and K. Sakallah, "Solving Difficult SAT Instances in the Presence of Symmetries," in Proc. of the Design Automation Conference (DAC), 731--736, 2002. Google ScholarDigital Library
- J. Crawford, M. Ginsberg, E. Luks, and A. Roy, "Symmetry-breaking predicates for search problems," in Proc. of the Intl. Conference Principles of Knowledge Representation and Reasoning, 148--159, 1996.Google Scholar
- DIMACS Challenge benchmarks in ftp://Dimacs.rutgers.EDU/pub/challenge/sat/benchmarks/cnf.Google Scholar
- I. Gessel and R. Stanley, "Algebraic Enumeration," in R. Graham, M. Grotschel and L. Lovasz, eds, Handbook of Combinatorics, vol. 2, MIT Press, 1021--1061, 1995. Google ScholarDigital Library
- E. Goldberg and Y. Novikov, "BerkMin: A fast and robust SAT-solver," in Proc. of DATE, 142--149, 2002. Google ScholarDigital Library
- B. McKay, "Practical Graph Isomorphism," in Congressus Numerantium, vol. 30, 45--87, 1981.Google Scholar
- M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an Efficient SAT Solver," in DAC, 530--535, 2001. Google ScholarDigital Library
- G. Nam, F. Aloul, K. Sakallah, and R. Rutenbar, "A Comparative Study of Two Boolean Formulations of FPGA Detailed Routing Constraints," in Proc. of Intl. Symp. on Physical Design, 222--227, 2001. Google ScholarDigital Library
- SAT 2002 Competition, http://www.satlive.org/SATCompetition/submittedbenchs.htmlGoogle Scholar
- A. Urquhart, "Hard Examples for Resolution," in Journal of the ACM, 34(1), 209--219, 1987. Google ScholarDigital Library
Recommendations
Exploiting structure in symmetry detection for CNF
DAC '04: Proceedings of the 41st annual Design Automation ConferenceInstances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed artifact, and thus are likely to possess much inherent symmetry and ...
Efficient Symmetry Breaking for Boolean Satisfiability
Identifying and breaking the symmetries of conjunctive normal form (CNF) formulae has been shown to lead to significant reductions in search times. Symmetries in the search space are broken by adding appropriate symmetry-breaking predicates (SBPs) to an ...
Enhancing Clause Learning by Symmetry in SAT Solvers
ICTAI '10: Proceedings of the 2010 22nd IEEE International Conference on Tools with Artificial Intelligence - Volume 01The satisfiability problem (SAT) is shown to be the first decision NP-complete problem. It is central in complexity theory. A CNF formula usually contains an interesting number of symmetries. That is, the formula remains invariant under some variable ...
Comments