Termination, AC-Termination and Dependency Pairs of Term Rewriting Systems (2000)

by Keiichirou Kusakari
Venue:Ph.D. thesis, JAIST
Citations:5 - 0 self

Active Bibliography

10 Knowledge Representation and Classical Logic – Vladimir Lifschitz, Leora Morgenstern
454 Rewriting – Nachum Dershowitz, David A. Plaisted - 2001
Chapter 1 Knowledge Representation and Classical Logic – Edited F. Van Harmelen, V. Lifschitz, B. Porter, Vladimir Lifschitz, Leora Morgenstern, David Plaisted
2 Proving First-Order Equality Theorems with Hyper-Linking – Geoffrey David Alexander - 1995
16 Simple Termination of Rewrite Systems – Aart Middeldorp, Hans Zantema - 1997
5 Eliminating Dummy Elimination – Jürgen Giesl , Aart Middeldorp - 2000
15 Approximating dependency graphs using tree automata techniques – Aart Middeldorp - 2001
1 Unifying the Knuth-Bendix, recursive path and polynomial orders – Akihisa Yamada, Toshiki Sakabe, Keiichirou Kusakari - 2013
83 Natural termination – Nachum Dershowitz, Charles Hoot
4 Mechanizing Dependency Pairs – Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke - 2003
20 Improving Dependency Pairs – Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke - 2003
Termination of Associative-Commutative Rewriting using Dependency Pairs Criteria – Kusakari Keiichirou, Claude Marché, Xavier Urbain - 2002
11 Rewrite Proofs and Computations – Jean-pierre Jouannaud - 1995
10 Simple Termination Revisited – Aart Middeldorp, Hans Zantema - 1994
Church’s Thesis – Guram Bezhanishvili
2 Historical Projects in Discrete Mathematics and Computer Science – Janet Barnett, Guram Bezhanishvili, Hing Leung, Jerry Lodder, David Pengelley, Desh Ranjan
32 Computability and recursion – Robert I. Soare - 1996
755 Inductive-Data-Type Systems – Frederic Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada - 2002
567 Term Rewriting Systems – J. W. Klop - 1992