|
81
|
Natural termination
– Nachum Dershowitz, Charles Hoot
|
|
431
|
Rewriting
– Nachum Dershowitz, David A. Plaisted
- 2001
|
|
20
|
33 Examples of Termination
– Nachum Dershowitz
- 1995
|
|
11
|
Rewrite Proofs and Computations
– Jean-pierre Jouannaud
- 1995
|
|
2
|
Associative-Commutative Reduction Orderings via Head-Preserving Interpretations
– Claude Marche
- 1995
|
|
2
|
Proving First-Order Equality Theorems with Hyper-Linking
– Geoffrey David Alexander
- 1995
|
|
5
|
Termination, AC-Termination and Dependency Pairs of Term Rewriting Systems
– Keiichirou Kusakari
- 2000
|
|
11
|
Termination of Constructor Systems
– Thomas Arts , Jürgen Giesl
- 1996
|
|
15
|
Simple Termination of Rewrite Systems
– Aart Middeldorp, Hans Zantema
- 1997
|
|
2
|
Knowledge Representation and Classical Logic
– Vladimir Lifschitz, Leora Morgenstern
|
|
|
A Complete Characterization of Termination of. . .
– Hans Zantema, Alfons Geser
- 1994
|
|
|
New Criteria for Strong and Innermost Normalisation
– Thomas Arts, Jürgen Giesl
- 1996
|
|
46
|
Generating Polynomial Orderings for Termination Proofs
– Jürgen Giesl
- 1995
|
|
195
|
Termination of Term Rewriting Using Dependency Pairs
– Thomas Arts, Jürgen Giesl
- 2000
|
|
2
|
Rewriting Methods for Word Problems
– Nachum Dershowitz
- 1992
|
|
4
|
Combinations of Simplifying Conditional Term Rewriting Systems
– Enno Ohlebusch
- 1992
|
|
550
|
Term Rewriting Systems
– J. W. Klop
- 1992
|
|
97
|
Paramodulation-Based Theorem Proving
– Robert Nieuwenhuis, Albert Rubio
- 1999
|
|
2
|
Solving gpo Ordering Constraints with a Shared Term Data Structure
– Thomas Genet, Isabelle Gnaedig
- 1996
|
