Term rewriting: Some experimental results

Authors:
David A. Plaisted;Richard C. Potter
Affiliations:
Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, North Carolina 27514, USA;Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, North Carolina 27514, USA
Venue:
Journal of Symbolic Computation
Year:
1991

Citing 4
Cited 3

Depth-first iterative-deepening: an optimal admissible tree search

Artificial Intelligence
Set theory in first-order logic: clauses for Go¨del's axioms

Journal of Automated Reasoning
Non-horn clause logic programming without contrapositives

Journal of Automated Reasoning
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)

RRTP - A Replacement Rule Theorem Prover

Journal of Automated Reasoning
Replacement Rules with Definition Detection

Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Theorem Proving Modulo

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss term rewriting in conjunction with sprfn, a Prolog-based theorem prover. Two techniques for theorem proving that utilize term rewriting are presented. The first technique simulates the replacement of predicates by their definitions in a Skolemtzed setting. The second technique permits tautologies to be recognized quickly. We demonstrate their effectiveness by exhibiting the results of our experiments in proving some theorems of von Neumann-Bernays-Godel set theory. We also show how the first technique can be used in any clausal theorem prover. Some outstanding problems associated with term rewriting are also addressed.