TRIP: An implementation of clausal rewriting
In this note we present the TRIP system, an implementation of clausal rewriting and completion. Its aim is to do theorem proving in theories expressed by so-called restricted equality clauses: general clauses without negative equality literals and with at most one positive one. Rewriting with complete systems of clausal rewrite rules provides a decision procedure for the given theory. The completion procedure itself is refutationally complete. These techniques have been described and the results proved in [NO 89], using the formalism of proof orderings, as in [BDH 86, Gan 87].
- [BDH 86]L. Bachmair, N. Dershowitz, J. Hsiang: Orderings for equational proofs. In Proc. Symp. Logic in Computer Science, 346–357, Boston (Massachusetts USA), 1986.Google Scholar
- [BGS 88a]H. Bertling, H. Ganzinger, R. Schafers: A collection of specifications completed by the CEC-system Report, PROSPECTRA-Project, U. Dortmund, 1988.Google Scholar
- [BGS 88b]H. Bertling, H. Ganzinger, R. Schafers: CEC: A system for conditional equational completion — User Manual (Version 1.0). Report, PROSPECTRA-Project, U. Dortmund, 1988.Google Scholar
- [Gan 87]H. Ganzinger: A completion procedure for conditional equations. 1st Intl. Workshop on Conditional Term Rewriting, Orsay (1987), also to appear in J. of Symb. Computation.Google Scholar
- [Kap 85]S. Kaplan: Fair conditional term rewriting systems: unification, termination and confluence. Recent Trends in Data Type Specification, Springer IFB 116 (1985).Google Scholar
- [NO 89]R. Nieuwenhuis, F. Orejas: Clausal Rewriting. Research Report LSI-89-29, Dept. Lenguajes y Sistemas Informáticos, UPC, nov. 1989. (also submitted elsewhere).Google Scholar