7 search results - page 1 / 2 » Symmetry breaking for pseudo-Boolean formulas |
JEA
2007
13 years 4 months ago
2007
ASPDAC
2004
ACM
13 years 10 months ago
2004
ACM
Many important tasks in circuit design and verification can be performed in practice via reductions to Boolean Satisfiability (SAT), making SAT a fundamental EDA problem. However ...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred...
IJCAI
2007
13 years 6 months ago
2007
AMAI
2004
Springer
13 years 4 months ago
2004
Springer