|
2
|
Knowledge Representation and Classical Logic
– Vladimir Lifschitz, Leora Morgenstern
|
|
11
|
Rewrite Proofs and Computations
– Jean-pierre Jouannaud
- 1995
|
|
432
|
Rewriting
– Nachum Dershowitz, David A. Plaisted
- 2001
|
|
19
|
Open Problems in Rewriting
– Nachum Dershowitz, Jean-pierre Jouannaud, Jan Willem Klop
- 1991
|
|
3
|
A Generalized Approach to Equational Unification
– Katherine Anne Yelick
- 1985
|
|
27
|
Bi-rewrite systems
– Jordi Levy, Jaume Agusti
- 1996
|
|
15
|
Simple Termination of Rewrite Systems
– Aart Middeldorp, Hans Zantema
- 1997
|
|
5
|
Termination, AC-Termination and Dependency Pairs of Term Rewriting Systems
– Keiichirou Kusakari
- 2000
|
|
4
|
Vademecum of Divergent Term Rewriting Systems
– Miki Hermann
- 1990
|
|
3
|
Theorem Proving with Transitive Relations from a Practical Point of View
– W. Marco Schorlemmer, Jaume Agusti
- 1995
|
|
18
|
Any Ground Associative-Commutative Theory Has a Finite Canonical System
– Paliath Narendran, Michaël Rusinowitch
- 1991
|
|
97
|
Paramodulation-Based Theorem Proving
– Robert Nieuwenhuis, Albert Rubio
- 1999
|
|
10
|
Simple Termination Revisited
– Aart Middeldorp, Hans Zantema
- 1994
|
|
1
|
Unique normal form property of compatible term rewriting systems - A new proof of Chew's theorem -
– Ken Mano, Mizuhito Ogawa
- 1999
|
|
24
|
Category-based Semantics for Equational and Constraint Logic Programming
– Razvan Diaconescu
- 1994
|
|
2
|
Linear and Unit-Resulting Refutations for Horn Theories
– Peter Baumgartner
- 1995
|
|
195
|
Termination of Term Rewriting Using Dependency Pairs
– Thomas Arts, Jürgen Giesl
- 2000
|
|
22
|
Automated Mathematical Induction
– Adel Bouhoula, Emmanuel Kounalis
- 1992
|
|
2
|
Proving First-Order Equality Theorems with Hyper-Linking
– Geoffrey David Alexander
- 1995
|
