Sciweavers

IJCAI
2001
13 years 6 months ago
Backjumping for Quantified Boolean Logic Satisfiability
The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Ma...
Enrico Giunchiglia, Massimo Narizzano, Armando Tac...
DLOG
2008
13 years 7 months ago
Checking DL-Lite Modularity with QBF Solvers
We show how the reasoning tasks of checking various versions of conservativity for the description logic DL-Litebool can be reduced to satisfiability of quantified Boolean formulas...
Roman Kontchakov, Vladislav Ryzhikov, Frank Wolter...
BIRTHDAY
2004
Springer
13 years 8 months ago
On Models for Quantified Boolean Formulas
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
Hans Kleine Büning, Xishun Zhao