An equality theorem prover based on grammar rewriting (original) (raw)

Abstract

ABSTRACT We present the implementation of a term rewriting procedure based on congruence closure. The procedure can be used with arbitrary equational theories. It uses context free grammars to represent equivalence classes of terms. This representation is motivated by the need to handle equational theories where confluence cannot be achieved under traditional term rewriting. Context free grammars provide concise representation of arbitrary-sized equivalence classes of terms.

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

References (11)

  1. Franz Baader. Rewrite systems for varieties of semigroups. CADE, 10:381-395, 1990.
  2. Robert S. Boyer and Struther Moore. A computational logic. ACM Monograph Series, Academic Press, 1979.
  3. L. Bachmair N. Dershowitz and D. Plaisted. Completion without failure. Proc. Col on Resolu- tion of Equations in Algegraic Structures, 1987.
  4. J. Hsaing and M. Rusinowitch. On word problems in equational theories. ICALP-87, LCNS 267, pages 54-71, 1987.
  5. Leslie P. JChew. An improved algorithm for computing with equations. FOCS80, IEEE Com- puter Society Press, pages 108-117, 1980.
  6. Thomas H. Cormen Charles E. Leiserson and Ronald L. Rivest. Introduction to Algorithms. MIT Press, Cambridge MA, 1990.
  7. Giancarlo Aanna Maria Paola Bonacina. Kblab: an equational theorem prover for the macin- tosh. CADE, pages 548-550, 1989.
  8. Ursula Martin and Tobias Nipkow. Ordered rewriting and confluence. CADE, 10:365-380, 1990.
  9. David McAllester. Grammar rewriting. CADE, 11:124-137, 1992.
  10. Greg Nelson and Derec Oppen. Fast decision procedures based on congruence closure. JACM, 27(2):356-395, 1980.
  11. Francis Jeffry Pelletier. Seventy-five problems for testing automatic theorem provers. JACM, 2:191-216, 1986.