Modular Termination Proofs for Rewriting Using Dependency Pairs
Authors:
- Jürgen GieslJGJürgen Giesl
- Thomas ArtsTAThomas Arts
- Enno OhlebuschEOEnno Ohlebusch
- 1 July 2002
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 34 (1) , 21-58
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- Simple termination of rewrite systemsTheoretical Computer Science, 1997
- Termination for direct sums of left-linear complete term rewriting systemsJournal of the ACM, 1995
- Interactions of Yersinia pestis penicillin-binding proteins with beta-lactam antibioticsAntimicrobial Agents and Chemotherapy, 1995
- Modular termination of term rewriting systems revisited1995
- Generalized sufficient conditions for modular termination of rewritingApplicable Algebra in Engineering, Communication and Computing, 1994
- Generating polynomial orderingsInformation Processing Letters, 1994
- Automating the Knuth Bendix orderingActa Informatica, 1990
- On termination of the direct sum of term-rewriting systemsInformation Processing Letters, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- A note on simplification orderingsInformation Processing Letters, 1979