9 search results - page 1 / 2 » Practical algorithms for unsatisfiability proof and core gen... |
AICOM
2010
13 years 5 months ago
2010
DAC
2007
ACM
14 years 6 months ago
2007
ACM
The ability of modern SAT solvers to produce proofs of unsatisfiability for Boolean formulas has become a powerful tool for EDA applications. Proofs are generated from a resolve t...
FM
2008
Springer
13 years 7 months ago
2008
Springer
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...
SAT
2005
Springer
13 years 11 months ago
2005
Springer
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
ICCAD
2010
IEEE
13 years 3 months ago
2010
IEEE
Craig Interpolation is a state-of-the-art technique for logic synthesis and verification, based on Boolean Satisfiability (SAT). Leveraging the efficacy of SAT algorithms, Craig In...