Term rewriting: Some experimental results

DOI10.1016/S0747-7171(08)80136-8zbMath0723.68058OpenAlexW1976790138MaRDI QIDQ757071

Richard C. Potter, David Alan Plaisted

Publication date: 1991

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(08)80136-8

zbMATH Keywords

deduction systemsimplified formal reduction format

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Open problems in rewriting ⋮ Theorem proving modulo ⋮ sprfn ⋮ Set theory for verification. I: From foundations to functions

Cites Work

• Unnamed Item
• Orderings for term-rewriting systems
• Depth-first iterative-deepening: An optimal admissible tree search
• Set theory in first-order logic: Clauses for Gödel's axioms
• Non-Horn clause logic programming without contrapositives
• A simplified problem reduction format
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems