Sciweavers

1930 search results - page 3 / 386
» Learning to Solve QBF
Sort
View
ICCAD
2002
IEEE
146views Hardware» more  ICCAD 2002»
14 years 4 months ago
Conflict driven learning in a quantified Boolean Satisfiability solver
Within the verification community, there has been a recent increase in interest in Quantified Boolean Formula evaluation (QBF) as many interesting sequential circuit verification ...
Lintao Zhang, Sharad Malik
SAT
2004
Springer
109views Hardware» more  SAT 2004»
14 years 1 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
SAT
2007
Springer
110views Hardware» more  SAT 2007»
14 years 1 months ago
Dynamically Partitioning for Solving QBF
Horst Samulowitz, Fahiem Bacchus
SAT
2005
Springer
107views Hardware» more  SAT 2005»
14 years 1 months ago
Local and Global Complete Solution Learning Methods for QBF
Solvers for Quantified Boolean Formulae (QBF) use many analogues of technique from SAT. A significant amount of work has gone into extending conflict based techniques such as co...
Ian P. Gent, Andrew G. D. Rowley