Orderings for term-rewriting systems

Theoretical Computer Science

Volumn 17, Issue 3, 1982, Pages 279-301

  Dershowitz, Nachum ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001138255     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(82)90026-3     Document Type: Article

References (28)

1. Automatic proofs of theorems in analysis using nonstandard techniques
2. A lemma driven automatic theorem prover for recursive function theory
3. Techniques for microprogram validation
4. Decision procedures for real and p-adic fields
5. A note on simplification orderings
6. Proving termination with multiset orderings
7. Confluent reductions Abstract properties and applications to term rewriting systems
8. On the uniform halting problem for term rewriting systems
9. Contributions to mechanical mathematics
10. Simple word problems in universal algebras
11. Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture
12. Canonical algebraic simplification in computational logic
13. On proving term rewriting systems are Noetherian
14. Decision procedures for simple equational theories with permutative axioms: Complete sets of permutative reductions
15. On the halting of tree replacement systems
16. Algebraic simplification a guide for the perplexed
17. On well-quasi-ordering finite trees
18. Well-founded orderings for proving termination of systems of rewrite rules
19. A recursively defined ordering for proving termination of term rewriting systems
20. Automated theorem-proving for theories with simplifiers, commutativity and associativity
21. Complete sets of reductions for some equational theories
22. A users manual for FOL