Advanced search
Start date
Betweenand


Paraconsistent logic programming in three and four valued logics

Full text
Author(s):
Kleidson Êglicio Carvalho da Silva Oliveira
Total Authors: 1
Document type: Doctoral Thesis
Press: Campinas, SP.
Institution: Universidade Estadual de Campinas (UNICAMP). Instituto de Filosofia e Ciências Humanas
Defense date:
Examining board members:
Marcelo Esteban Coniglio; José Carlos Magossi; Renata Wassermann; Luiz Henrique da Cruz Silvestrini; Eduardo Fermé
Advisor: Marcelo Esteban Coniglio
Abstract

From the interaction among areas such as Computer Science, Logic and Automated Deduction arises an important new area called Logic Programming. This has been used continuously in the theoretical study and practical applications in various fields of Artificial Intelligence. After increasing the number of types of non-classical logics, and understanding the limitations of classical first-order logic, became necessary to consider logic programming with other types of reasonings than the classical. One type that has been studied extensively is the paraconsistent reasoning, that is, reasoning tolerant to contradictions. However, although there are many paraconsistent logics with varying semantics, its application to logic programming is more delicate than it appears at rst sight, requiring a thorough study of what can or can not be transferred directly from the classical first-order logic for other types of logic. Based on studies of [Rod10] on the foundations of Paraconsistent Logic Programming for some Logics of Formal Inconsistency (LFIs), this work is intended to resume the research of [Rod10] and place it in the specific context of LFIs with three and four valued semantics, which are interesting of the computational point of view, as presented in Silvestrini [Sil11] and Coniglio and Figallo [CF12]. This study aims to define, from original techniques, well-founded systems of paraconsistent logic programming based on well-know logics, in contrast to the "ad hoc" approaches in the literature found to this question (AU)

FAPESP's process: 13/04555-7 - Bases for paraconsistent logic programming in multi-valued logics
Grantee:Kleidson Êglicio Carvalho da Silva Oliveira
Support Opportunities: Scholarships in Brazil - Doctorate