Elsevier

Journal of Symbolic Computation

Volume 11, Issues 1–2, January–February 1991, Pages 51-81
Journal of Symbolic Computation

A completion procedure for conditional equationst

https://doi.org/10.1016/S0747-7171(08)80132-0Get rights and content
Under an Elsevier user license
open archive

Abstract

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.

Cited by (0)

A preliminary version of this paper has appeared in the Proceedings of the First International Workshop on Conditional Term Rewriting, Orsay, June 1987, Springer Lecture Notes in Computer Science, 1988.

This work was partially supported by the ESPRIT-project PROSPECTRA, ref. no. 390, at the University of Dortmund, Germany.