RI: a logic for reasoning with inconsistency
- 7 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The authors present a logic, called RI (reasoning with inconsistency), that treats any set of clauses, either consistent or not, in a uniform way. In this logic, consequences of a contradiction are not nearly as damaging as in the standard predicate calculus, and meaningful information can still be extracted from an inconsistent set of formulas. RI has a resolution-based sound and complete proof procedure. It is a much richer logic than the predicate calculus, and the latter can be imitated within RI in several different ways (depending on the intended meaning of the predicate calculus formulas). The authors also introduce a novel notion of epistemic entailment and show its importance for investigating inconsistency in the predicate calculus.Keywords
This publication has 11 references indexed in Scilit:
- On the Declarative Semantics of Deductive Databases and Logic ProgramsPublished by Elsevier ,1988
- On the Declarative Semantics of Logic Programs with NegationPublished by Elsevier ,1988
- Towards a Theory of Declarative KnowledgePublished by Elsevier ,1988
- Paraconsistent logic programmingPublished by Springer Nature ,1987
- Applications of circumscription to formalizing common-sense knowledgeArtificial Intelligence, 1986
- A functional approach to non‐monotonic logic1Computational Intelligence, 1985
- On the semantics of rule-based expert systems with uncertaintyPublished by Springer Nature ,1983
- A logic for default reasoningArtificial Intelligence, 1980
- On the theory of inconsistent formal systems.Notre Dame Journal of Formal Logic, 1974
- An Equational Axiomatization for the Disjoint System of Post AlgebrasIEEE Transactions on Computers, 1973