82
Voted
DLOG
2008
14 years 12 months ago
2008
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...
ECAI
2004
Springer
15 years 1 months ago
2004
Springer
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. ...