The idea of combining the advantages of function and logic programming has attracted many researchers. Their work ranges from the integration of existing languages over higher-order logic to equational logic languages, where logic programs are augmented with equational theories. Recently, it has been proposed to handle those equational theories by complete sets of transformations. These transformations are extensions of the rules introduced by Herbrand and later used by Martelli and Montanari to compute the most general unifier of two expressions. We generalize this idea to complete sets of transformations for arbitrary conditional equational theories, the largest class of equational theories that admit a least Herbrand model. The completeness proof is based on the observation that each refutation with respect to linear paramodulation and reflection can be modelled by the transformations. As certain conditions imposed on an equational theory restrict the search space generated by paramodulation and reflection we can easily refine our transformations-due to the completeness proof-if the conditional equational theory is ground confluent or canonical. © 1990.
Hölldobler, S. (1990). Conditional equational theories and complete sets of transformations. Theoretical Computer Science, 75(1–2), 85–110. https://doi.org/10.1016/0304-3975(90)90063-N