Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-28T08:49:20.599Z Has data issue: false hasContentIssue false

Paraconsistent Logic Programming in Three and Four-Valued Logics

Published online by Cambridge University Press:  28 June 2022

Kleidson Êglicio Carvalho da Silva Oliveira*
Affiliation:
University of Campinas, Brazil, 2017.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

From the interaction among areas such as Computer Science, Formal Logic, and Automated Deduction arises an important new subject called Logic Programming. This has been used continuously in the theoretical study and practical applications in various fields of Artificial Intelligence. After the emergence of a wide variety of non-classical logics and the understanding of the limitations presented by first-order classical logic, it became necessary to consider logic programming based on other types of reasoning in addition to classical reasoning. A type of reasoning that has been well studied is the paraconsistent, that is, the reasoning that tolerates contradictions. However, although there are many paraconsistent logics with different types of semantics, their application to logic programming is more delicate than it first appears, requiring an in-depth study of what can or cannot be transferred directly from classical first-order logic to other types of logic.

Based on studies of Tarcisio Rodrigues on the foundations of Paraconsistent Logic Programming (2010) for some Logics of Formal Inconsistency (LFIs), this thesis intends to resume the research of Rodrigues and place it in the specific context of LFIs with three- and four-valued semantics. This kind of logics are interesting from the computational point of view, as presented by Luiz Silvestrini in his Ph.D. thesis entitled “A new approach to the concept of quase-truth” (2011), and by Marcelo Coniglio and Martín Figallo in the article “Hilbert-style presentations of two logics associated to tetravalent modal algebras” [Studia Logica (2012)]. Based on original techniques, this study aims to define well-founded systems of paraconsistent logic programming based on well-known logics, in contrast to the ad hoc approaches to this question found in the literature.

Abstract prepared by Kleidson Êglicio Carvalho da Silva Oliveira.

E-mail: [email protected]

URL: http://repositorio.unicamp.br/jspui/handle/REPOSIP/322632

MSC classification

Type
Thesis Abstracts
Copyright
© The Author(s), 2022. Published by Cambridge University Press on behalf of The Association for Symbolic Logic

Footnotes

Supervised by Marcelo Esteban Coniglio.