Oxford Journals
tools journals homepage advanced search contact help
Journal of Logic and Computation: Current Issue
 
home
browse
current
etoc
authors
subinfo
subscribers
samples

OUP > Journals > Computing/Engineer. & Mathematics/Stats. > Journal of Logic and Computation

Journal of Logic and Computation

Volume 13, Issue 4, June 2003: pp. 557-580

Original Article
Reducing Preferential Paraconsistent Reasoning to Classical Entailment

Ofer Arieli1 and Marc Denecker2

1Department of Computer Science, The Academic College of Tel-Aviv, 4 Antokolski street, Tel-Aviv 61161, Israel. E-mail: oarieli@mta.ac.il
2Department of Computer Science, The Catholic University of Leuven, Celestijnenlaan 200A, B-3001, Heverlee, Belgium. E-mail: marcd@cs.kuleuven.ac.be

We introduce a general method for paraconsistent reasoning in the context of classical logic. A standard technique for paraconsistent reasoning on inconsistent classical theories is by shifting to multiple-valued logics. We show how these multiple-valued theories can be 'shifted back' to two-valued classical theories through a polynomial transformation, and how preferential reasoning based on multiple-valued logic can be represented by classical circumscription-like axioms. By applying this process we provide new ways of implementing multiple-valued paraconsistent reasoning. Standard multiple-valued reasoning can thus be performed through theorem provers for classical logic, and multiple-valued preferential reasoning can be implemented using algorithms for processing circumscriptive theories (such as DLS and SCAN).

Keywords: Paraconsistent reasoning, preferential semantics, circumscription, multiple-valued logics.

Table of Contents   Full-Text PDF (236 KB)

Oxford University Press
Published by Oxford University Press
Copyright ©Oxford University Press 2003
Print ISSN: 0955-792X  Online ISSN: 1465-363X.
Oxford University Press Privacy Policy and Legal Statement