Basic Paramodulation

We introduce a class of restrictions for the ordered paramodulation and superposition calculi (inspired by the basic strategy for narrowing), in which paramodulation inferences are forbidden at terms introduced by substitutions from previous inference steps. In addition we introduce restrictions based on term selection rules and redex orderings, which are general criteria for delimiting the terms which are available for inferences. These refinements are compatible with standard ordering restrictions and are complete without paramodulation into variables or using functional reflexivity axioms. We prove refutational completeness in the context of deletion rules, such as simplification by rewriting (demodulation) and subsumption, and of techniques for eliminating redundant inferences.

[1]  David A. Plaisted,et al.  A Complete Semantic Back Chaining Proof System , 1990, CADE.

[2]  Jean-Marie Hullot,et al.  Canonical Forms and Unification , 1980, CADE.

[3]  Larry Wos,et al.  Automated reasoning - 33 basic research problems , 1988 .

[4]  Andreas Werner,et al.  An Optimal Narrowing Strategy for General Canonical Systems , 1992, CTRS.

[5]  Harald Ganzinger,et al.  Rewrite-Based Equational Theorem Proving with Selection and Simplification , 1994, J. Log. Comput..

[6]  Albert Rubio,et al.  Basic Superposition is Complete , 1992, ESOP.

[7]  William McCune,et al.  Skolem Functions and Equality in Automated Deduction , 1990, AAAI.

[8]  Werner Nutt,et al.  Basic Narrowing Revisited , 1989, J. Symb. Comput..

[9]  Daniel Brand,et al.  Proving Theorems with the Modification Method , 1975, SIAM J. Comput..

[10]  HuetGérard.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980 .

[11]  Larry Wos,et al.  The Concept of Demodulation in Theorem Proving , 1967, JACM.

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

[13]  Alexander Bockmayr,et al.  Detecting Redundant Narrowing Derivations by the LSE-SL Reducability Test , 1991, RTA.

[14]  Laurent Fribourg,et al.  A Strong Restriction of the Inductive Completion Procedure , 1986, J. Symb. Comput..

[15]  L. Bachmair.  Canonical Equational Proofs , 1991, Progress in Theoretical Computer Science.

[16]  Alexander Herold.  Narrowing Techniques Applied to Idempotent Unification , 1987, GWAI.

[17]  Gerald E. Peterson,et al.  Using Forcing to Prove Completeness of Resolution and Paramodulation , 1991, J. Symb. Comput..

[18]  Gerald E. Peterson,et al.  A Technique for Establishing Completeness Results in Theorem Proving with Equality , 1980, SIAM J. Comput..

[19]  Wayne Snyder,et al.  Goal Directed Strategies for Paramodulation , 1991, RTA.

[20]  Wayne Snyder.  Proof theory for general unification , 1993, Progress in computer science and applied logic.

[21]  Michaël Rusinowitch,et al.  Proving refutational completeness of theorem-proving strategies: the transfinite semantic tree method , 1991, JACM.

[22]  Albert Rubio,et al.  Theorem Proving with Ordering Constrained Clauses , 1992, CADE.

[23]  D. Kapur,et al.  Reduction, superposition and induction: automated reasoning in an equational logic , 1988 .

[24]  Wayne Snyder,et al.  Basic Paramodulation and Superposition , 1992, CADE.

[25]  Norbert Eisinger.  A Note on the Completeness of Resolution with Self-Resolution , 1989, Inf. Process. Lett..

[26]  Harald Ganzinger,et al.  On Restrictions of Ordered Paramodulation with Simplification , 1990, CADE.