A Redundancy Criterion Based on Ground Reducibility by Ordered Rewriting
Author:
- 1 January 2004
- book chapter
- Published by Springer Nature
- p. 45-59
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Solving simplification ordering constraints2005
- On using ground joinable equations in equational theorem provingJournal of Symbolic Computation, 2003
- Deciding the confluence of ordered term rewrite systemsACM Transactions on Computational Logic, 2003
- Knuth-Bendix Constraint Solving Is NP-Complete2001
- Rewriting2001
- The first-order theory of lexicographic path orderings is undecidableTheoretical Computer Science, 1997
- Shostak's congruence closure as completion1997
- Rewrite-based Equational Theorem Proving with Selection and SimplificationJournal of Logic and Computation, 1994
- Simple LPO constraint solving methodsInformation Processing Letters, 1993
- Ordered rewriting and confluence1990