Solving difficult SAT instances in the presence of symmetry.
Fadi A. AloulArathi RamaniIgor L. MarkovKarem A. SakallahPublished in: DAC (2002)
Keyphrases
- sat instances
- sat solvers
- satisfiability problem
- sat problem
- randomly generated
- stochastic local search
- propositional satisfiability
- computational properties
- search space
- symmetry breaking
- phase transition
- np complete
- random sat instances
- search tree
- database
- boolean formula
- boolean satisfiability
- systematic search algorithms
- search strategies
- decision makers
- special case
- genetic algorithm