Sciweavers

2 search results - page 1 / 1
» Shatter: efficient symmetry-breaking for boolean satisfiabil...
Sort
View
82
Voted
IJCAI
2003
15 years 17 days 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
67
Voted
DAC
2003
ACM
16 years 5 days ago
Shatter: efficient symmetry-breaking for boolean satisfiability
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah