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
••
12 citations
••
01 May 2015TL;DR: In this article, a paraconsistent mereotopology is proposed, which focuses on the role of empty parts, in delivering a balanced and bounded metaphysics of naive space.
Abstract: Mereotopology is a theory of connected parts. The existence of boundaries, as parts of everyday objects, is basic to any such theory; but in classical mereotopology, there is a problem: if boundaries exist, then either distinct entities cannot be in contact, or else space is not topologically connected (Varzi in Nous 31:26–58, 1997). In this paper we urge that this problem can be met with a paraconsistent mereotopology, and sketch the details of one such approach. The resulting theory focuses attention on the role of empty parts, in delivering a balanced and bounded metaphysics of naive space.
12 citations
••
17 Jul 2011TL;DR: This paper presents a paraconsistent deontic logic, i.e. a logic that invalidates the classical principle of non-contradiction, and strengthens this logic within the adaptive logics framework for defeasible reasoning.
Abstract: In a multi-agent deontic setting, normative conflicts can take a variety of different logical forms. In this paper, we present a very general characterization of such conflicts, including both intra- and interagent normative conflicts, conflicts between groups of agents, conflicts between obligations and permissions, and conflicts between contradictory norms. In order to account for the consistent possibility of this wide variety of conflict-types, we present a paraconsistent deontic logic, i.e. a logic that invalidates the classical principle of non-contradiction. Next, we strengthen this logic within the adaptive logics framework for defeasible reasoning. The resulting inconsistency-adaptive deontic logic interprets a given set of norms 'as consistently as possible'.
12 citations
•
TL;DR: A newParaconsistent description logic, PALC, is obtained from the description logic ALC by adding a paraconsistent negation, and some theorems for embedding PALC into ACL are proved, and PALC is shown to be decidable.
Abstract: Inconsistency handling is of growing importance in Knowl- edge Representation since inconsistencies may frequently occur in an open world. Paraconsistent (or inconsistency-tolerant) description logics have been studied by several researchers to cope with such inconsis- tencies. In this paper, a new paraconsistent description logic, PALC, is obtained from the description logic ALC by adding a paraconsistent negation. Some theorems for embedding PALC into ACL are proved, and PALC is shown to be decidable. A tableau calculus for PALC is introduced, and the completeness theorem for this calculus is proved.
12 citations
••
TL;DR: This paper gives a uniform representation of various semantics for logic programs based on a four-valued inference and concludes that the distinction between these semantics can be largely attributed to the difference in their underlying (monotonic) logical systems.
Abstract: We suggested in Part I of this study a general logical formalism for Logic Programming based on a four-valued inference. In this paper we give a uniform representation of various semantics for logic programs based on this formalism. The main conclusion from this representation is that the distinction between these semantics can be largely attributed to the difference in their underlying (monotonic) logical systems. Moreover, in most cases the difference can even be reduced to that of the language, that is, to the difference in the logical connectives allowed for representing derivable information.
12 citations