26 search results - page 2 / 6 » An Efficient Sequential SAT Solver With Improved Search Stra... |
ICCAD
2002
IEEE
14 years 2 months ago
2002
IEEE
Within the verification community, there has been a recent increase in interest in Quantified Boolean Formula evaluation (QBF) as many interesting sequential circuit verification ...
GLVLSI
2005
IEEE
13 years 11 months ago
2005
IEEE
Boolean Satisfiability (SAT) solvers are popular engines used throughout the verification world. Bounded sequential problems such as bounded model checking and bounded sequentia...
ECAI
2008
Springer
13 years 7 months ago
2008
Springer
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
SAT
2004
Springer
13 years 10 months ago
2004
Springer
2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as i...
CP
2010
Springer
13 years 4 months ago
2010
Springer
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...