Redundancy Notions for Paramodulation with Non-monotonic Orderings

Recently, ordered paramodulation and Knuth-Bendix completion were shown to remain complete when using non-monotonic orderings. However, these results only implied the compatibility with too weak redundancy notions and, in particular, demodulation could not be applied at all.

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

[2]  Albert Rubio,et al.  Complete Monotonic Semantic Path Orderings , 2000, CADE.

[3]  Albert Rubio,et al.  Well-Foundedness Is Sufficient for Completeness of Ordered Paramodulation , 2002, CADE.

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

[5]  Albert Rubio,et al.  Paramodulation-Based Theorem Proving , 2001, Handbook of Automated Reasoning.

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

[7]  Andrei Voronkov,et al.  Automated Deduction—CADE-18 , 2002, Lecture Notes in Computer Science.

[8]  W. Bibel,et al.  Automated deduction : a basis for applications , 1998 .

[9]  Albert Rubio,et al.  Paramodulation with non-monotonic orderings , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[10]  Wolfgang Wechler,et al.  Universal Algebra for Computer Scientists , 1992, EATCS Monographs on Theoretical Computer Science.

[11]  Albert Rubio,et al.  Paramodulation and Knuth–Bendix Completion with Nontotal and Nonmonotonic Orderings , 2003, Journal of Automated Reasoning.

[12]  Nachum Dershowitz,et al.  Equational inference, canonical proofs, and proof orderings , 1994, JACM.

[13]  David A. McAllester,et al.  Automated Deduction - CADE-17 , 2000, Lecture Notes in Computer Science.

[14]  Wayne Snyder,et al.  Basic Paramodulation , 1995, Inf. Comput..