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. This framework provides a useful platform for capturing, in a simple and natural way, a wide range of methods for preferential reasoning. Off-the-shelf QBF solvers may therefore be incorporated for simulating the corresponding consequence relations.

• Type: Conference
• Year: 2004
• Where: ECAI
• Authors: Ofer Arieli
• Keywords: Artificial Intelligence, ECAI 2004, Off-the-shelf QBF Solvers, Paraconsistent Non-monotonic Formalisms, Quantified Boolean Formulae