RI: a logic for reasoning with inconsistency

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.<<ETX>>

[1]  John McCarthy,et al.  Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.

[2]  Nuel D. Belnap,et al.  How a Computer Should Think , 2019, New Essays on Belnap-­Dunn Logic.

[3]  Melvin Fitting,et al.  Bilattices and the Semantics of Logic Programming , 1991, J. Log. Program..

[4]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[5]  Nuel D. Belnap,et al.  A Useful Four-Valued Logic , 1977 .

[6]  Donald Perlis Circumscription as Introspection , 1987, ISMIS.

[7]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[8]  Ronald Fagin,et al.  Belief, Awareness, and Limited Reasoning. , 1987, Artif. Intell..

[9]  Michael Kifer,et al.  On the Semantics of Rule-Based Expert Systems with Uncertainty , 1988, ICDT.

[10]  Matthew L. Ginsberg,et al.  Multivalued logics: a uniform approach to reasoning in artificial intelligence , 1988, Comput. Intell..

[11]  Robert C. Moore A Formal Theory of Knowledge and Action , 1984 .

[12]  Jack Minker Foundations of deductive databases and logic programming , 1988 .

[13]  Kurt Konolige,et al.  A Resolution Method for Quantified Modal Logics of Knowledge and Belief , 1986, TARK.

[14]  Melvin Fitting Negation as refutation , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[15]  George Epstein An Equational Axiomatization for the Disjoint System of Post Algebras , 1973, IEEE Transactions on Computers.

[16]  Hector J. Levesque,et al.  A Logic of Implicit and Explicit Belief , 1984, AAAI.

[17]  Vladimir Lifschitz,et al.  On the Declarative Semantics of Logic Programs with Negation , 1987, Foundations of Deductive Databases and Logic Programming..

[18]  Teodor C. Przymusinski On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[19]  Erik Sandewall,et al.  A Functional Approach to Non-Monotonic Logic , 1985, IJCAI.

[20]  Newton C. A. da Costa,et al.  On the theory of inconsistent formal systems , 1974, Notre Dame J. Formal Log..

[21]  V. S. Subrahmanian,et al.  Paraconsistent Logic Programming , 1987, Theor. Comput. Sci..

[22]  V. S. Subrahmanian,et al.  Paraconsistent Logic Programming , 1987, FSTTCS.

[23]  Melvin Fitting,et al.  Destructive Modal Resolution , 1990, J. Log. Comput..

[24]  Michael Kifer,et al.  HiLog: A First-Order Semantics for Higher-Order Logic Programming Constructs , 1989, NACLP.

[25]  Erik Sandewall,et al.  A functional approach to non‐monotonic logic 1 , 1985 .

[26]  V. S. Subrahmanian,et al.  On the Expressive Power of Annotated Logic Programs , 1989, NACLP.

[27]  Nicholas Rescher,et al.  The logic of inconsistency , 1979 .

[28]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[29]  V. S. Subrahmanian On the Semantics of Quantitative Logic Programs , 1987, SLP.

[30]  David S. Touretzky,et al.  A Clash of Intuitions: The Current State of Nonmonotonic Multiple Inheritance Systems , 1987, IJCAI.

[31]  M. H. van Emden,et al.  Quantitative Deduction and its Fixpoint Theory , 1986, J. Log. Program..

[32]  Graham Priest,et al.  Reasoning About Truth , 1989, Artif. Intell..