Sciweavers

Share
AAAI
2007
9 years 10 months ago
Asymptotically Optimal Encodings of Conformant Planning in QBF
The world is unpredictable, and acting intelligently requires anticipating possible consequences of actions that are taken. Assuming that the actions and the world are determinist...
Jussi Rintanen
SAT
2005
Springer
107views Hardware» more  SAT 2005»
10 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
CP
2005
Springer
10 years 1 months ago
Using SAT in QBF
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
Horst Samulowitz, Fahiem Bacchus
SAT
2009
Springer
109views Hardware» more  SAT 2009»
10 years 2 months ago
A Compact Representation for Syntactic Dependencies in QBFs
Different quantifier types in Quantified Boolean Formulae (QBF) introduce variable dependencies which have to be taken into consideration when deciding satisfiability of a QBF....
Florian Lonsing, Armin Biere
books