Topic
Paraconsistent logic
About: Paraconsistent logic is a research topic. Over the lifetime, 1610 publications have been published within this topic receiving 28842 citations.
Papers published on a yearly basis
Papers
More filters
Journal Article•
TL;DR: An approach to translating any ALC ontology (possible inconsistent) into a logically consistent set of disjunctive datalog rules and can be viewed as a paraconsistent version of KAON2 algorithm is proposed.
Abstract: In this paper, we propose an approach to translating any ALC ontology (possible inconsistent) into a logically consistent set of disjunctive datalog rules. We achieve this in two steps: First we give a simple way to make anyALC based ontology 4-valued satisfiable, and then we study a sound and complete paraconsistent ordered-resolution decision procedure for our 4-valuedALC. Our approach can be viewed as a paraconsistent version of KAON2 algorithm.
8 citations
Journal Article•
TL;DR: An extended first-order predicate sequent calculus PLK with two kinds of negation is introduced as a basis of a new resolution calculus PRC (paraconsistent resolution calculus) for handling the property of paraconsistency.
Abstract: An extended first-order predicate sequent calculus PLK with two kinds of negation is introduced as a basis of a new resolution calculus PRC (paraconsistent resolution calculus) for handling the property of paraconsistency. Herbrand theorem, completeness theorem (with respect to a classical-like semantics) and cut-elimination theorem are proved for PLK. The correspondence between PLK and PRC is shown by using a faithful embedding of PLK into the sequent calculus LK for classical logic.
8 citations
01 Jan 2015
TL;DR: Soundness and completeness theorems are established in a three-valued paraconsistent logic obtained from some algebra-valued model of set theory.
Abstract: This paper presents a three-valued paraconsistent logic obtained from some algebra-valued model of set theory. Soundness and completeness theorems are established. The logic has been compared with other three-valued paraconsistent logics.
8 citations
Proceedings Article•
03 Jan 1990
TL;DR: A general scheme for Partial Evaluation to be applied to a wide class of structuring policies for logic programming, capable of supporting both block and inheritancebased systems is defined.
Abstract: We discuss the impact of Partial Evaluation within the framework of structured logic programming. We define a general scheme for Partial Evaluation to be applied to a wide class of structuring policies for logic programming, capable of supporting both blockand inheritancebased systems. We show how the properties of soundness and completeness of Partial Evaluation in Logic Programming are preserved in this extended scheme.
8 citations