Sciweavers

31 search results - page 1 / 7
» Faster SAT solving with better CNF generation
Sort
View
DATE
2009
IEEE
85views Hardware» more  DATE 2009»
13 years 10 months ago
Faster SAT solving with better CNF generation
Boolean satisfiability (SAT) solving has become an enabling technology with wide-ranging applications in numerous disciplines. These applications tend to be most naturally encode...
Benjamin Chambers, Panagiotis Manolios, Daron Vroo...
ICCAD
2001
IEEE
144views Hardware» more  ICCAD 2001»
14 years 16 days ago
Faster SAT and Smaller BDDs via Common Function Structure
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
DAC
2004
ACM
14 years 4 months ago
Exploiting structure in symmetry detection for CNF
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
Paul T. Darga, Mark H. Liffiton, Karem A. Sakallah...
TACAS
2010
Springer
191views Algorithms» more  TACAS 2010»
13 years 10 months ago
Blocked Clause Elimination
Boolean satisfiability (SAT) and its extensions are becoming a core technology for the analysis of systems. The SAT-based approach divides into three steps: encoding, preprocessin...
Matti Järvisalo, Armin Biere, Marijn Heule
SAT
2004
Springer
109views Hardware» more  SAT 2004»
13 years 9 months ago
Resolve and Expand
We present a novel expansion based decision procedure for quantified boolean formulas (QBF) in conjunctive normal form (CNF). The basic idea is to resolve existentially quantifie...
Armin Biere