A Completion Procedure for Conditional Equations

The paper presents a new completion procedure for conditional equations. The work is based on the notion of reductive conditional rewriting and the procedure has been designed to handle in particular non-reductive equations that are generated during completion. The paper also describes techniques for simplification of conditional equations and rules, so that the procedure terminates on more specifications. The correctness proofs which form a substantial part of this paper employ recursive path orderings on the proof trees of conditional equational logic, an extension of the ideas of Bachmair, Dershowitz & Hsiang to the conditional case.

[1]  Wilhelm Ackermann,et al.  Solvable Cases Of The Decision Problem , 1954 .

[2]  Harald Ganzinger.  Completion with History-Dependent Complexities for Generated Equations , 1987, ADT.

[3]  Stéphane Kaplan.  Fair Conditional Term Rewriting Systems: Unification, Termination, and Confluence , 1984, ADT.

[4]  Michaël Rusinowitch.  Theorem-Proving with Resolution and Superposition: An Extension of the Knuth and Bendic Procedure to a Complete Set of Inference Rules , 1988, FGCS.

[5]  Harald Ganzinger.  Ground Term Confluence in Parametric Conditional Equational Specifications , 1987, STACS.

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

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

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

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

[10]  Heinrich Hußmann,et al.  Unification in Conditional Equational Theories , 1985, European Conference on Computer Algebra.

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

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

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

[14]  Jan A. Bergstra,et al.  Conditional Rewrite Rules: Confluence and Termination , 1986, J. Comput. Syst. Sci..

[15]  G. Huet,et al.  Equations and rewrite rules: a survey , 1980 .

[16]  Stéphane Kaplan,et al.  A Compiler for Conditional Term Rewriting Systems , 1987, RTA.

[17]  Maurice Nivat,et al.  Resolution of Equations in Algebraic Structures , 1989 .

[18]  Stéphane Kaplan,et al.  Conditional Rewrite Rules , 1984, Theor. Comput. Sci..

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

[20]  Leo Bachmair,et al.  Proof Normalization for Resolution and Paramodulation , 1989, RTA.

[21]  Michaël Rusinowitch.  Theorem-Proving with Resolution and Superposition , 1991, J. Symb. Comput..

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

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

[24]  Hantao Zhang,et al.  Contextual Rewriting , 1985, RTA.

[25]  Jean-Pierre Jouannaud,et al.  Reductive conditional term rewriting systems , 1987, Formal Description of Programming Concepts.

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

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

[28]  Harald Ganzinger,et al.  System support for modular order-sorted Horn clause specifications , 1990, [1990] Proceedings. 12th International Conference on Software Engineering.

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

[30]  Hantao Zhang,et al.  REVEUR 4: A System for Validating Conditional Algebraic Specifications of Abstract Data Types , 1984, ECAI.

[31]  Stéphane Kaplan,et al.  Completion Algorithms for Conditional Rewriting Systems , 1989 .