Term rewriting: Some experimental results
We discuss term rewriting in conjunction with sprfn, a Prolog-based theorem prover. Two techniques for theorem proving that utilize term rewriting are presented. We demonstrate their effectiveness by exhibiting the results of our experiments in proving some theorems of von Neumann-Bernays-Gödel set theory. Some outstanding problems associated with term rewriting are also addressed.
Key words and phrasesTheorem proving term rewriting set theory
Unable to display preview. Download preview PDF.
- Boyer, Robert, Lusk, Ewing, McCune, William, Overbeek, Ross, Stickel, Mark, and Wos, Lawrence, ‘Set theory in first-order logic: clauses for Gödel's axioms', Journal of Automated Reasoning 2 (1986) 287–327Google Scholar
- Plaisted, D.A., ‘Another extension of Horn clause logic programming to non-Horn clauses', Lecture Notes 1987Google Scholar
- Plaisted, D.A., ‘Non-Horn clause logic programming without contrapositives', unpublished manuscript 1987Google Scholar
- Loveland, D.W., Automated Theorem Proving: A Logical Base, North-Holland Publishing Co., 1978, Chapter 6.Google Scholar