Equational inference, canonical proofs, and proof orderings

We describe the application of proof orderings—a technique for reasoning about inference systems-to various rewrite-based theorem-proving methods, including refinements of the standard Knuth-Bendix completion procedure based on critical pair criteria; Huet's procedure for rewriting modulo a congruence; ordered completion (a refutationally complete extension of standard completion); and a proof by consistency procedure for proving inductive theorems.

[1]  Jean-Pierre Jouannaud,et al.  Unification in free extensions of Boolean rings and Abelian groups , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[2]  David R. Musser,et al.  On proving inductive properties of abstract data types , 1980, POPL '80.

[3]  Harald Ganzinger,et al.  A Completion Procedure for Conditional Equations , 1988, J. Symb. Comput..

[4]  Jean-Pierre Jouannaud,et al.  Automatic Proofs by Induction in Theories without Constructors , 1989, Inf. Comput..

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

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

[7]  Deepak Kapur,et al.  Consider Only General Superpositions in Completion Procedures , 1989, RTA.

[8]  Uday S. Reddy,et al.  Term Rewriting Induction , 1990, CADE.

[9]  Trevor Evans.  On multiplicative systems defined by generators and relations , 1953 .

[10]  N. A C H U M D E R S H O W I T Z.  Termination of Rewriting' , 2022 .

[11]  Nachum Dershowitz,et al.  Existence, Uniqueness, and Construction of Rewrite Systems , 1988, SIAM J. Comput..

[12]  Nachum Dershowitz,et al.  Completion and Its Applications , 1989 .

[13]  Bernhard Gramlich.  Completion Based Inductive Theorem Proving: An Abstract Framework and its Applications , 1990, ECAI.

[14]  Akihiko Ohsuga,et al.  Metis: A Term Rewriting System Generator: An Inference Engine for Equations and Inequations , 1991, Software Science and Engineering.

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

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

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

[18]  Nachum Dershowitz,et al.  Ordering-Based Strategies for Horn Clauses , 1991, IJCAI.

[19]  Wolfgang Küchlin,et al.  Inductive Completion by Ground Proof Transformation , 1989 .

[20]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

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

[22]  Paliath Narendran,et al.  Automating Inductionless Induction Using Test Sets , 1991, J. Symb. Comput..

[23]  Gerard Huet,et al.  Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[24]  Jalel Mzali.  Méthodes de filtrage équationnel et de preuve automatique de théorèmes , 1986 .

[25]  Deepak Kapur,et al.  Proof by Consistency , 1987, Artif. Intell..

[26]  Bruno Buchberger,et al.  A critical-pair/completion algorithm for finitely generated ideals in rings , 1983, Logic and Machines.

[27]  Wolfgang Küchlin.  Equational completion by proof transformation , 1986 .

[28]  Nachum Dershowitz,et al.  Rewriting Methods for Word Problems , 1992 .

[29]  Leo Bachmair.  Proof methods for equational theories , 1987 .

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

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

[32]  T. Evans.  On multiplicative systems defined by generators and relations , 1951, Mathematical Proceedings of the Cambridge Philosophical Society.

[33]  Mark E. Stickel,et al.  Complete Sets of Reductions for Some Equational Theories , 1981, JACM.

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

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

[36]  Wolfgang Küchlin,et al.  A Confluence Criterion Based on the Generalised Neman Lemma , 1985, European Conference on Computer Algebra.

[37]  Harald Ganzinger,et al.  Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria , 1992, LPAR.

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

[39]  Paliath Narendran,et al.  Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion Procedure , 1988, J. Symb. Comput..

[40]  Wolfgang Küchlin,et al.  Computing Ground Reducability and Inductively Complete Positions , 1989, RTA.

[41]  H. Comon.  Solving Inequations in Term Algebras (Extended Abstract ) , 1990, LICS 1990.

[42]  Laurent Fribourg,et al.  A Superposition Oriented Theorem Prover , 1983, IJCAI.

[43]  Laurent Fribourg.  A Strong Restriction of the Inductive Completion Procedure , 1989, J. Symb. Comput..

[44]  Uday S. Reddy,et al.  Rewriting Techniques for Program Synthesis , 1989, RTA.

[45]  Nachum Dershowitz,et al.  Critical Pair Criteria for Completion , 1988, J. Symb. Comput..

[46]  Nachum Dershowitz,et al.  Completion for Rewriting Modulo a Congruence , 1987, Theor. Comput. Sci..

[47]  Bruno Buchberger,et al.  A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm , 1983, SIGS.

[48]  Paliath Narendran,et al.  Rigid E-unification is NP-complete , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[49]  Proceedings of the Cambridge Philosophical Society , 2022 .

[50]  Joseph A. Goguen,et al.  How to Prove Algebraic Inductive Hypotheses Without Induction , 1980, CADE.

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

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

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

[54]  Jean-Pierre Jouannaud,et al.  Proofs by induction in equational theories without constructors , 1985, Bull. EATCS.

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

[56]  Nachum Dershowitz,et al.  Inference Rules for Rewrite-Based First-Order Theorem Proving , 1987, LICS.

[57]  Gérard P. Huet,et al.  A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm , 1981, J. Comput. Syst. Sci..

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

[59]  Nachum Dershowitz,et al.  Rewrite Methods for Clausal and Non-Clausal Theorem Proving , 1983, ICALP.

[60]  Yves Métivier.  About the Rewriting Systems Produced by the Knuth-Bendix Completion Algorithm , 1983, Inf. Process. Lett..

[61]  David A. Plaisted,et al.  Semantic Confluence Tests and Completion Methods , 1985, Inf. Control..

[62]  Wayne Snyder,et al.  Rigid E -Unification and, Its Applications to Equational Matings , 1989 .

[63]  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 .

[64]  Gérard P. Huet,et al.  Proofs by induction in equational theories with constructors , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).