Ordering-Based Strategies for Horn Clauses

Two new theorem-proving procedures for equational Horn clauses are presented. The largest literal is selected for paramodulation in both strategies, except that one method treats positive literals as larger than negative ones and results in a unit strategy. Both use term orderings to restrict paramodulation to potentially maximal sides of equations and to increase the amount of allowable simplification (demodulation). Completeness is shown using proof orderings.

[1]  Hubert Bertling.  Knuth-Bendix Completion of Horn Clause Programs for Restricted Linear Resolution and Paramodulation , 1990, CTRS.

[2]  Jean-Pierre Jouannaud,et al.  Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable , 1991, ICALP.

[3]  L. Wos,et al.  Paramodulation and Theorem-Proving in First-Order Theories with Equality , 1983 .

[4]  Fernando Orejas,et al.  Clausal Rewriting , 1990, CTRS.

[5]  Michaël Rusinowitch,et al.  On Word Problems in Equational Theories , 1987, ICALP.

[6]  Nachum Dershowitz,et al.  Termination of Rewriting , 1987, J. Symb. Comput..

[7]  Michaël Rusinowitch,et al.  A New Method for Establishing Refutational Completeness in Theorem Proving , 1986, CADE.

[8]  Michaël Rusinowitch,et al.  On Word Problems in Horn Theories , 1988, J. Symb. Comput..

[9]  T. C. Brown.  A structured design-method for specialized proof procedures , 1975 .

[10]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[11]  Stéphane Kaplan,et al.  Simplifying Conditional Term Rewriting Systems: Unification, Termination and Confluence , 1987, J. Symb. Comput..

[12]  M. Okada,et al.  Conditional and typed rewriting systems : 2nd International CTRS Workshop, Montreal, Canada, June 11-14, 1990 : proceedings , 1991 .

[13]  Deepak Kapur,et al.  First-Order Theorem Proving Using Conditional Rewrite Rules , 1988, CADE.

[14]  Harald Ganzinger.  A Completion Procedure for Conditional Equations , 1987, CTRS.

[15]  Samuel B. Williams,et al.  Association for Computing Machinery , 2009 .

[16]  I. G. BONNER CLAPPISON.  Editor , 1960, The Electric Power Engineering Handbook - Five Volume Set.

[17]  Zohar Manna,et al.  Proving termination with multiset orderings , 1979, CACM.

[18]  Nachum Dershowitz,et al.  Completion Without Failure11This research was supported in part by the National Science Foundation under grants DCR 85–13417 and DCR 85–16243. , 1989 .

[19]  Harald Ganzinger,et al.  Completion-Time Optimization of Rewrite-Time Goal Solving , 1989, RTA.

[20]  E. Paul.  On Solving the Equality Problem in Theories Defined by Horn Clauses , 1986, Theor. Comput. Sci..

[21]  Nachum Dershowitz,et al.  Orderings for Equational Proofs , 1986, LICS.

[22]  Ulrich Furbach.  Oldy but Goody Paramodulation Revisited , 1987, GWAI.

[23]  Nachum Dershowitz,et al.  A Maximal-Literal Unit Strategy for Horn Clauses , 1990, CTRS.

[24]  Nachum Dershowitz,et al.  Proof-theoretic techniques for term rewriting theory , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[25]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[26]  Harald Ganzinger,et al.  Completion of First-Order Clauses with Equality by Strict Superposition (Extended Abstract) , 1990, CTRS.

[27]  Lawrence J. Henschen,et al.  Unit Refutations and Horn Sets , 1974, JACM.