Annotated Hyperresolution for Non-horn Regular Multiple-Valued Logics

This paper focuses on non-Horn formulas for the class of regular signed logics, also known as annotated logics. Resolution-based inference systems for these logics are not new, but most earlier work has concentrated on Horn formulas, to which the logic programming paradigm applies. Here a restriction of annotated resolution and reduction called annotated hyperresolution is introduced. The new rule is developed for arbitrary CNF formulas of regular signed logics and is shown to be complete.

[1]  V. S. Subrahmanian,et al.  Theory of Generalized Annotated Logic Programming and its Applications , 1992, J. Log. Program..

[2]  J. A. Robinson,et al.  Automatic Deduction with Hyper-Resolution , 1983 .

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

[4]  V. S. Subrahmanian.  Paraconsistent Disjunctive Deductive Databases , 1992, Theor. Comput. Sci..

[5]  Reiner Hähnle.  Exploiting Data Dependencies in Many-Valued Logics , 1996, J. Appl. Non Class. Logics.

[6]  Neil V. Murray,et al.  Omega-Resolution: An Inference Rule for Regular Multiple-Valued Logics , 1998, JELIA.

[7]  Neil V. Murray,et al.  Adapting Classical Inference Techniques to Multiple-Valued Logics Using Signed Formulas , 1994, Fundam. Informaticae.

[8]  W. W. Bledsoe,et al.  A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness , 1970, JACM.

[9]  Bernhard Beckert,et al.  Transformations between signed and classical clause logic , 1999, Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329).

[10]  Neil V. Murray,et al.  Improving tableau deductions in multiple-valued logics , 1991, [1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic.

[11]  Viorica Sofronie-Stokkermans.  On Translation of Finitely-Valued Logics to Classical First-Order Logic , 1998, ECAI.

[12]  Michael Kifer,et al.  RI: a logic for reasoning with inconsistency , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[13]  Reiner Hähnle,et al.  Deduction in many-valued logics: a survey , 1997 .

[14]  Krishnaprasad Thirunarayan,et al.  A Theory of Nonmonotonic Inheritance Based on Annotated Logic , 1993, Artif. Intell..

[15]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

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

[17]  Reiner Hähnle,et al.  Automated deduction in multiple-valued logics , 1993, International series of monographs on computer science.

[18]  Viorica Sofronie-Stokkermans,et al.  Automated Theorem Proving by Resolution for Finitely-Valued Logics Based on Distributive Lattices with Operators , 2001 .

[19]  Reiner Hähnle,et al.  Some Remarks on Completeness, Connection Graph Resolution and Link Deletion , 1998, TABLEAUX.