Equational methods in first order predicate calculus

A preliminary version of this paper was presented as “A new interpretation of the resolution principle” at the 7th International Conference on Automated Deduction in Napa, California, May 1984. The proceedings are in Springer-Verlag, Lecture Notes in Computer Sciences 170, edited by R. E. Shostak.
https://doi.org/10.1016/S0747-7171(85)80026-2Get rights and content
Under an Elsevier user license
open archive

We show that the application of the resolution principle to a set of clauses can be regarded as the construction of a term rewriting system confluent on valid formulas. This result allows the extension of usual properties and methods of equational theories (such as Birkhoff's theorem and the Knuth and Bendix completion algorithm) to quantifier-free first order theories. These results are extended to first order predicate calculus in an equational theory, as studied by Plotkin (1972), Slagle (1974) and Lankford (1975). This paper is a continuation of the work of Hsiang & Dershowitz (1983), who have already shown that rewrite methods can be used in first order predicate calculus. The main difference is the following: Hsiang uses rewrite methods only as a refutational proof technique, the initial set of formulas being unsatisfiable iff the equation TRUE = FALSE is generated by the completion algorithm. We generalise these methods to satisfiable theories; in particular, we show that the concept of confluent rewriting system, which is the main tool for studying equational theories, can be extended to any quantifier-free first order theory. Furthermore, we show that rewrite methods can be used even if formulas are kept in clausal form.

Cited by (0)