Université de Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR 5800(波尔多大学、法国国家科学研究中心、波尔多INP、LaBRI、UMR 5800);Japanese-French Laboratory for Informatics, CNRS, NII, IRL 2537(日法信息实验室、法国国家科学研究中心、日本信息产业技术研究所、IRL 2537);National Institute of Informatics, Tokyo, Japan(日本信息处理研究所)
This is an extended version of a paper with the same title appearing at the 21st International Conference on Principles of Knowledge Representation and Reasoning (KR 2024)
We explore the problem of explaining observations starting from a classically inconsistent theory by adopting a paraconsistent framework. We consider two expansions of the well-known Belnap--Dunn paraconsistent four-valued logic $\mathsf{BD}$: $\mathsf{BD}_\circ$ introduces formulas of the form $\circϕ$ (the information on $ϕ$ is reliable), while $\mathsf{BD}_\triangle$ augments the language with $\triangleϕ$'s (there is information that $ϕ$ is true). We define and motivate the notions of abduction problems and explanations in $\mathsf{BD}_\circ$ and $\mathsf{BD}_\triangle$ and show that they are not reducible to one another. We analyse the complexity of standard abductive reasoning tasks (solution recognition, solution existence, and relevance / necessity of hypotheses) in both logics. Finally, we show how to reduce abduction in $\mathsf{BD}_\circ$ and $\mathsf{BD}_\triangle$ to abduction in classical propositional logic, thereby enabling the reuse of existing abductive reasoning procedures.
Institute of Philosophy and the Humanities (IFCH) and Centre for Logic, Epistemology and The History of Science (CLE), University of Campinas (UNICAMP)(坎皮纳斯大学哲学与人文学院(IFCH)及逻辑、认识论与科学史中心(CLE))
DLV是一个高效的逻辑编程和非单调推理(LPNMR)系统,具有先进的知识表示机制和经典关系数据库系统的接口。它的核心语言是具有完整性约束的答案集语义(Answer Set Semantics)下的析取数据库(无函数析取逻辑编程),包括默认和强(或显式)否定以及查询。还支持算术运算和各种内置谓词。此外,DLV有几个前端,即勇敢和谨慎的推理,溯因诊断,基于一致性的诊断,SQL 3的一个子集,使用动作语言进行规划,以及使用继承进行逻辑编程。