295 search results - page 37 / 59 » SAT, SMT and Applications |
103
click to vote
ICCAD
1996
IEEE
15 years 6 months ago
1996
IEEE
This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an integrated algorithmic framework for SAT that unifies several previously proposed searchp...
IJCAI
2001
15 years 3 months ago
2001
The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Ma...
132
click to vote
C3S2E
2010
ACM
15 years 3 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
181
click to vote
TCAD
2010
14 years 8 months ago
2010
As contemporary VLSI designs grow in complexity, design debugging has rapidly established itself as one of the largest bottlenecks in the design cycle today. Automated debug soluti...
102
click to vote
ICTAI
2008
IEEE
15 years 8 months ago
2008
IEEE
These last years, the issue of locating and explaining contradictions inside sets of propositional clauses has received a renewed attention due to the emergence of very efficient...