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
03 Jul 1995
TL;DR: In this article, a new paraconsistent logic, called quasi-classical logic (or QC logic) is proposed, which allows the derivation of non-trivializable classical inferences.
Abstract: Here we present a new paraconsistent logic, called quasi-classical logic (or QC logic) that allows the derivation of non-trivializable classical inferences. For this it is necessary that queries are in conjunctive normal form and the reasoning process is essentially that of clause finding. We present a proof-theoretic definition, and semantics, and show that the consequence relation observes reflexivity, monotonicity and transitivity, but fails cut and supraclassicality. Finally we discuss some of the advantages of this logic, over other paraconsistent logics, for applications in information systems.
97 citations
Book•
20 Jun 2000
TL;DR: Interestingly, frontiers of paraconsistent logic that you really wait for now is coming, and it's significant to wait for the representative and beneficial books to read.
Abstract: Interestingly, frontiers of paraconsistent logic that you really wait for now is coming. It's significant to wait for the representative and beneficial books to read. Every book that is provided in better way and utterance will be expected by many peoples. Even you are a good reader or not, feeling to read this book will always appear when you find it. But, when you feel hard to find it as yours, what to do? Borrow to your friends and don't know when to give back it to her or him.
96 citations
28 Jul 2002
TL;DR: This paper provides a general characterization of inconsistency, based on quasi-classical logic, a form of paraconsistent logic with a more expressive semantics than Belnap's four-valued logic, and unlike other paraconsistant logics, allows the connectives to appear to behave as classical connectives.
Abstract: The language for describing inconsistency is underdeveloped. If a knowledgebase (a set of formulae) is inconsistent, we need more illuminating ways to say how inconsistent it is, or to say whether one knowledgebase is "more inconsistent" than another. To address this, we provide a general characterization of inconsistency, based on quasi-classical logic (a form of paraconsistent logic with a more expressive semantics than Belnap's four-valued logic, and unlike other paraconsistent logics, allows the connectives to appear to behave as classical connectives). We analyse inconsistent knowledge by considering the conflicts arising in the minimal quasi-classical models for that knowledge. This is used for a measure of coherence for each knowledgebase, and for a preference ordering, called the compromise relation, over knowledgebases. In this paper, we formalize this framework, and consider applications in managing heterogeneous sources of knowledge.
95 citations
01 Jan 1981
TL;DR: This paper argues that a proper theory of conditional obligation, like one of “conditional quantification”, will be the product of two separate components: a theories of the conditional, and a theory of obligation.
Abstract: Most of the recent work in deontic logic has concentrated on problems concerning “conditional obligation”. I’ve felt for a long time that this has been a mistake. A proper theory of conditional obligation, like one of “conditional quantification”, will be the product of two separate components: a theory of the conditional, and a theory of obligation.
94 citations