Invariants, patterns and weights for ordering terms
From MaRDI portal
Publication:1581131
DOI10.1006/jsco.1999.0333zbMath0963.68090OpenAlexW1997859797WikidataQ55393289 ScholiaQ55393289MaRDI QIDQ1581131
Duncan Shand, Ursula Martin Webb
Publication date: 14 September 2000
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/61b86334349de8e49c4cbc93e6db9a3755b84745
Related Items (2)
Orienting rewrite rules with the Knuth-Bendix order. ⋮ On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Termination of rewriting systems by polynomial interpretations and its implementation
- Orderings for term-rewriting systems
- Term rewriting theory for the primitive recursive functions
- Automating the Knuth Bendix ordering
- A note on division orderings on strings
- The Gröbner fan of an ideal
- A geometrical approach to multiset orderings
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Termination of term rewriting: Interpretation and type elimination
- Simple termination is difficult
- Weights for total division orderings on strings
- Some group theoretic examples with completion theorem provers
- The order types of termination orderings on monadic terms, strings and multisets
- Scott's conjecture is true, position sensitive weights
- Theorem proving with group presentations: Examples and questions
- Linear interpretations by counting patterns
This page was built for publication: Invariants, patterns and weights for ordering terms
