Paraconsistent Assertions

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review


Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where inconsistency does not lead to such an explosion. We argue that paraconsistent logics are especially advantageous in order to deal with assertions made by intelligent agents. Other propositional attitudes like knowledge and beliefs can in principle be treated along the same lines. We propose a many-valued paraconsistent logic based on a simple notion of indeterminacy. The proposed paraconsistent logic has a semantics that extends the one of classical logic and it is described using key equalities for the logical operators. A case study is included. We briefly compare with logics based on bilattices. We finally investigate how to translate the paraconsistent logic into classical predicate logic thereby allowing us to make use of automated deduction of classical logic in the future. We base our initial translation on recent work by Muskens. Our final translation is polynomial in the size of the translated formula and follows the semantics for the paraconsistent logic directly. © Springer-Verlag Berlin Heidelberg 2004.
Original languageEnglish
Title of host publicationMultiagent System Technologies : Second German Conference, MATES 2004, Erfurt, Germany, September 29-30, 2004. Proceedings
Publication date2004
ISBN (Print)978-3-540-23222-3
Publication statusPublished - 2004
Externally publishedYes
Event2nd German Conference on Multiagent System Technologies - Erfurt, Germany
Duration: 29 Sept 200430 Sept 2004
Conference number: 2


Conference2nd German Conference on Multiagent System Technologies
SeriesLecture Notes in Computer Science


Dive into the research topics of 'Paraconsistent Assertions'. Together they form a unique fingerprint.

Cite this