ITEM METADATA RECORD
Title: Circumscriptive approaches to paraconsistent reasoning
Authors: Arieli, Ofer
Denecker, Marc
Issue Date: Jan-2001
Publisher: Department of Computer Science, K.U.Leuven, Leuven, Belgium
Series Title: CW Reports vol:CW304
Abstract: 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, and how preferential reasoning based on multiple-valued logic can be represented by classical circumscription-like axioms. By applying this process we manage to overcome the shortcoming of classical logic in properly handling inconsistent data, and provide new ways of implementing multiple-valued paraconsistent reasoning through theorem provers for classical logic. Standard multiple-valued reasoning can thus be incorporated with specialized methods for compiling circumscriptive theories, and multiple-valued preferential reasoning can be implemented using algorithms for processing second-order formulae (such as DLS and SCAN).
URI: 
Publication status: published
KU Leuven publication type: IR
Appears in Collections:Informatics Section

Files in This Item:
File Status SizeFormat
CW304.pdf Published 321KbAdobe PDFView/Open

 


All items in Lirias are protected by copyright, with all rights reserved.