Sciweavers

DLOG
2008
14 years 11 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...
ECAI
2004
Springer
15 years 18 days ago
Paraconsistent Preferential Reasoning by Signed Quantified Boolean Formulae
We introduce a uniform approach of representing a variety of paraconsistent non-monotonic formalisms by quantified Boolean formulae (QBFs) in the context of four-valued semantics. ...
Ofer Arieli