ECAI 2004 Conference Paper

[PDF] [full paper] [prev] [tofc] [next]

Paraconsistent Preferential Reasoning by Signed Quantified Boolean Formulae

Ofer Arieli

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, wide range of methods for preferential reasoning. Off-the-shelf QBF solvers may therefore be incorporated for simulating the corresponding consequence relations.

Keywords: paraconsistent and preferential reasoning, quantified Boolean formulae, multiple-valued logics

Citation: Ofer Arieli: Paraconsistent Preferential Reasoning by Signed Quantified Boolean Formulae. In R.López de Mántaras and L.Saitta (eds.): ECAI2004, Proceedings of the 16th European Conference on Artificial Intelligence, IOS Press, Amsterdam, 2004, pp.773-777.

[prev] [tofc] [next]

ECAI-2004 is organised by the European Coordinating Committee for Artificial Intelligence (ECCAI) and hosted by the Universitat Politècnica de València on behalf of Asociación Española de Inteligencia Artificial (AEPIA) and Associació Catalana d'Intel-ligència Artificial (ACIA).