Term rewriting: Some experimental results

  • Richard C. Potter
  • David A. Plaisted
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 310)


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 phrases

Theorem proving term rewriting set theory 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Plaisted, D.A., ‘A simplified problem reduction format', Artificial Intelligence 18 (1982) 227–261CrossRefGoogle Scholar
  2. [2]
    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
  3. [3]
    Plaisted, D.A., ‘Another extension of Horn clause logic programming to non-Horn clauses', Lecture Notes 1987Google Scholar
  4. [4]
    Plaisted, D.A., ‘Non-Horn clause logic programming without contrapositives', unpublished manuscript 1987Google Scholar
  5. [5]
    Loveland, D.W., Automated Theorem Proving: A Logical Base, North-Holland Publishing Co., 1978, Chapter 6.Google Scholar
  6. [6]
    Korf, R.E., ‘Depth-first iterative-deepening: an optimal admissible tree search', Artificial Intelligence 27 (1985) 97–109.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Richard C. Potter
    • 1
  • David A. Plaisted
    • 1
  1. 1.Department of Computer ScienceUniversity of North Carolina at Chapel HillChapel Hill

Personalised recommendations