Sciweavers

2 search results - page 1 / 1
» Shatter: efficient symmetry-breaking for boolean satisfiabil...
Sort
View
IJCAI
2003
14 years 11 months ago
Efficient Symmetry Breaking for Boolean Satisfiability
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...
Fadi A. Aloul, Karem A. Sakallah, Igor L. Markov
58
Voted
DAC
2003
ACM
15 years 10 months ago
Shatter: efficient symmetry-breaking for boolean satisfiability
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah