Paraconsistent Logic Programming in Three and Four-Valued Logics

Kleidson Êglicio Carvalho da Silva Oliveira
{"title":"Paraconsistent Logic Programming in Three and Four-Valued Logics","authors":"Kleidson Êglicio Carvalho da Silva Oliveira","doi":"10.1017/bsl.2021.34","DOIUrl":null,"url":null,"abstract":"Abstract 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: kecso10@yahoo.com.br URL: http://repositorio.unicamp.br/jspui/handle/REPOSIP/322632","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Bulletin of Symbolic Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1017/bsl.2021.34","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Abstract 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: kecso10@yahoo.com.br URL: http://repositorio.unicamp.br/jspui/handle/REPOSIP/322632
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
三值和四值逻辑中的副一致逻辑规划
在计算机科学、形式逻辑和自动演绎等领域的相互作用下,产生了一门重要的新学科——逻辑程序设计。这在人工智能各个领域的理论研究和实际应用中得到了不断的应用。在各种各样的非经典逻辑的出现和对一阶经典逻辑的局限性的理解之后,除了经典推理之外,有必要考虑基于其他类型推理的逻辑规划。有一种推理已经被很好地研究过了,那就是,能容忍矛盾的推理。然而,尽管有许多具有不同类型语义的副一致逻辑,但它们在逻辑编程中的应用比最初看起来更加微妙,需要深入研究什么可以或不可以直接从经典一阶逻辑转移到其他类型的逻辑。基于Tarcisio Rodrigues(2010)对一些形式不一致逻辑(lfi)的准一致逻辑规划的基础研究,本文打算恢复Rodrigues的研究,并将其置于具有三值和四值语义的lfi的特定背景下。从计算的角度来看,这种逻辑很有趣,正如Luiz Silvestrini在他的博士论文“准真概念的新方法”(2011)中所提出的,以及Marcelo Coniglio和Martín Figallo在文章“与四价模态代数相关的两种逻辑的hilbert式表示”[Studia Logica(2012)]中所提出的那样。在原始技术的基础上,本研究旨在定义基于已知逻辑的、有良好基础的准一致逻辑编程系统,与文献中发现的针对该问题的特别方法形成对比。摘要由Kleidson Êglicio Carvalho da Silva Oliveira制备。电子邮件:kecso10@yahoo.com.br URL: http://repositorio.unicamp.br/jspui/handle/REPOSIP/322632
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
POUR-EL’S LANDSCAPE CATEGORICAL QUANTIFICATION POINCARÉ-WEYL’S PREDICATIVITY: GOING BEYOND A TOPOLOGICAL APPROACH TO UNDEFINABILITY IN ALGEBRAIC EXTENSIONS OF John MacFarlane, Philosophical Logic: A Contemporary Introduction, Routledge Contemporary Introductions to Philosophy, Routledge, New York, and London, 2021, xx + 238 pp.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1