# Solving difficult SAT instances in the presence of symmetry

@inproceedings{Aloul2002SolvingDS, title={Solving difficult SAT instances in the presence of symmetry}, author={F. Aloul and A. Ramani and I. Markov and K. Sakallah}, booktitle={DAC '02}, year={2002} }

Research in algorithms for Boolean satisfiability and their implementations [23, 6] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks [10] can be solved in seconds on commodity PCs. More recent benchmarks take longer to solve because of their large size, but are still solved in minutes [25]. Yet, small and difficult SAT instances must exist because Boolean satisfiability is NP-complete.We propose an improved construction of symmetry-breaking clauses [9] and apply… Expand

#### 152 Citations

Symmetry Breaking for Boolean Satisfiability : The Mysteries of Logic Minimization

Boolean Satisfiability solvers improved dramatically over the last seven years [14, 13] and are commonly used in applications such as bounded model checking, planning, and FPGA routing. However, a… Expand

Breaking instance-independent symmetries in exact graph coloring

- Mathematics, Computer Science
- Proceedings Design, Automation and Test in Europe Conference and Exhibition
- 2004

This work compares several avenues for symmetry-breaking, in particular when certain kinds of symmetry are present in all generated instances, and concludes that instance-independent symmetries should often be processed together with instance-specific asymmetries rather than earlier, at the specification level. Expand

Breaking instance-independent symmetries in exact graph coloring

- Mathematics
- 2004

Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Naturally-occurring instances of such… Expand

Shatter: efficient symmetry-breaking for Boolean satisfiability

- Computer Science
- Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451)
- 2003

This paper presents several new constructions of SBPs that improve on previous work and gives a linear-sized CNF formula that selects lex-leaders for single permutations and shows how that formula can be simplified by taking advantage of the sparsity of permutations. Expand

Dynamic symmetry-breaking for Boolean satisfiability

- Mathematics, Computer Science
- Annals of Mathematics and Artificial Intelligence
- 2010

This work proposes several new techniques that treat objective functions differently from CNF/PB constraints and accelerate Boolean optimization in many practical cases, and introduces a new objective function, Localized Bit Selection (LBS), that can be used to specify a preference for bit values in formal verification applications. Expand

Dynamic symmetry-breaking for improved Boolean optimization

- Mathematics
- Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.
- 2005

With impressive progress in Boolean satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as high-performance formal… Expand

Enhancing Clause Learning by Symmetry in SAT Solvers

- Computer Science
- 2010 22nd IEEE International Conference on Tools with Artificial Intelligence
- 2010

This paper implemented the symmetry clause learning approach on the MiniSat solver and experimented it on several SAT instances and the results obtained are very promising and show that clause learning by symmetry is profitable for CDCL SAT solvers. Expand

Overcoming Resolution-Based Lower Bounds for SAT Solvers

- Mathematics, Computer Science
- IWLS
- 2002

This work shows how to extend Compressed-BFS to perform Boolean Constraint Propagation, part of all practical, complete SAT solvers, and empirical results show that full BCP offers marginal improvements in runtime. Expand

Solution and Optimization of Systems of Pseudo-Boolean Constraints

- Mathematics, Computer Science
- IEEE Transactions on Computers
- 2007

The experimental results show that specialized 0-1 techniques implemented in PBS tend to outperform generic ILP techniques on Boolean optimization problems, as well as on general EDA SAT problems. Expand

Automatically Exploiting Symmetries in Constraint Programming

- Mathematics, Computer Science
- CSCLP
- 2004

This work introduces a framework for studying and solving a class of CSP formulations that generalizes earlier work on symmetries in SAT and 0-1 ILP problems, and shows substantial speedups with symmetry-breaking, especially on unsatisfiable instances. Expand

#### References

SHOWING 1-10 OF 50 REFERENCES

Faster SAT and smaller BDDs via common function structure

- Computer Science
- IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281)
- 2001

This work points out that SAT and BDD techniques can be improved via the use of the same structural properties of instances, and proposes methods based on efficient problem partitioning that often outperforms existing techniques by a factor of two or more. Expand

The Efficiency of Resolution and Davis--Putnam Procedures

- Computer Science, Mathematics
- SIAM J. Comput.
- 2002

This work gives an algorithm for unsatisfiability that when given an unsatisfiable formula of F finds a resolution proof of F, and investigates a class of backtrack search algorithms for producing resolution refutations of unsatisfiability, commonly known as Davis--Putnam procedures, and gives the first asymptotically tight average-case complexity analysis for their behavior on random formulas. Expand

Tractability through symmetries in propositional calculus

- Mathematics, Computer Science
- Journal of Automated Reasoning
- 2004

This work proves for the first time the unsatisfiability of Ramsey's problem (17 vertices and three colors) which has been the subject of much research. Expand

Symmetry Reductions in Model Checking

- Computer Science
- CAV
- 1998

It is proved that the orbit problem is equivalent to an important problem in computational group theory which is at least as hard as the graph isomorphism but not known to be NP-complete. Expand

Finding hard instances of the satisfiability problem: A survey

- Computer Science
- Satisfiability Problem: Theory and Applications
- 1996

The performance of the most popular SAT algorithms on random problems, the theory of average case complexity, the threshold phenomenon, known lower bounds for certain classes of algorithms, and the problem of generating hard instances with solutions are considered. Expand

A comparative study of two Boolean formulations of FPGA detailed routing constraints

- Mathematics, Computer Science
- IEEE Transactions on Computers
- 2004

It is demonstrated that the route-based formulation of Boolean SAT-based routing yields an easier-to-evaluate and more scalable routability Boolean function than the track-based method, providing empirical evidence that a smart/efficient Boolean formulation can achieve significant performance improvement in real-world applications. Expand

Symmetry-Breaking Predicates for Search Problems

- Computer Science
- KR
- 1996

This work presents a general scheme whereby symmetries are exploited by adding \symmetry-breaking" predicates to the theory, and discusses methods for generating partial symmetry-breaking predicates, and shows that in several speciic cases asymmetries can be broken either fully or partially using a polynomial number of predicates. Expand

Better verification through symmetry

- Computer Science
- Formal Methods Syst. Des.
- 1993

This work provides a proof of the soundness of the new symmetry-based verification algorithm based on a definition of the formal semantics of a simple description language with scalarsets, and leads to an alternative characterization of data independence. Expand

GRASP: A Search Algorithm for Propositional Satisfiability

- Mathematics, Computer Science
- IEEE Trans. Computers
- 1999

Experimental results obtained from a large number of benchmarks indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for aLarge number of representative classes of SAT instances. Expand

GRASP-A new search algorithm for satisfiability

- Computer Science
- Proceedings of International Conference on Computer Aided Design
- 1996

Experimental results obtained from a large number of benchmarks, including many from the field of test pattern generation, indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for aLarge number of representative classes of SAT instances. Expand