Paraconsistent Logic in AI

Jørgen Villadsen - Research Seminar 2004-09-16

Abstract

Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to achieve there are many potential applications of paraconsistent logics in Computer Science and Artificial Intelligence (AI). The talk gives an overview of the forthcoming presentations at the conferences Artificial Intelligence and Symbolic Computation (AISC 2004) and Multiagent System Technologies (MATES 2004).

The first paper presents a concise description of a paraconsistent higher order logic with countably infinite indeterminacy. The meaning of the logical operators is different from traditional many-valued logics as well as from logics based on bilattices. Higher order logics are expressive and with several automated theorem provers available.

The second paper argues that paraconsistent logic is 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. A first order variant of the paraconsistent higher order logic is translated into classical predicate logic.

Papers

• A Paraconsistent Higher Order Logic   Artificial Intelligence and Symbolic Computation - AISC 2004   LNCS

• Paraconsistent Assertions   Multiagent System Technologies - MATES 2004   LNCS

• Paraconsistent Query Answering Systems   Flexible Query Answering Systems - FQAS 2002   LNCS

• Combinators for Paraconsistent Attitudes   Logical Aspects of Computational Linguistics - LACL 2001   LNCS

Slides

• 1 per page - landscape format - tiny margins
• 1 per page - landscape format
• 2 per page
• 6 per page