Orderings for term-rewriting systems

@article{Dershowitz1979OrderingsFT,
  title={Orderings for term-rewriting systems},
  author={Nachum Dershowitz},
  journal={20th Annual Symposium on Foundations of Computer Science (sfcs 1979)},
  year={1979},
  pages={123-131}
}
  • N. Dershowitz
  • Published 1979
  • Mathematics
  • 20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
Methods of proving that a term-rewriting system terminates are presented. They are based on the notion of "simplification orderings", orderings in which any term that is homeomorphically embeddable in another is smaller than the other. A particularly useful class of simplification orderings, the "recursive path orderings", is defined. Several examples of the use of such orderings in termination proofs are given. 
A Path Ordering for Proving Termination of Term Rewriting Systems
TLDR
A new partial ordering scheme for proving uniform termination of term rewriting systems is presented and it is shown that the ordering is a well-founded simplification ordering and also a strict extension of the recursive path ordering scheme of Dershowitz. Expand
Termination of Rewriting
TLDR
Methods for proving that systems of rewrite rules are terminating programs are described, including polynomial interpretations and path orderings, which are used in termination proofs of various kinds of orderings on terms. Expand
Simplification orderings: Putting them to the test
  • J. Steinbach
  • Mathematics, Computer Science
  • Journal of Automated Reasoning
  • 2004
TLDR
A collection of well-known simplification orderings will be briefly presented including path orderings and decomposition orderings to describe a detailed empirical study of their time complexities with respect to comparable pairs of terms. Expand
The Termination Hierarchy for Term Rewriting
  • H. Zantema
  • Mathematics, Computer Science
  • Applicable Algebra in Engineering, Communication and Computing
  • 2001
Abstract. A number of properties of term rewriting systems related to termination are discussed. It is examined how these properties are affected by modifications in the definitions like weakeningExpand
Termination of Order-sorted Rewriting
TLDR
The goal is to perform termination proofs of programs for executable specification languages like OBJ3, and an extension of Lexicographic Path Ordering is proposed, that gives a termination proof for order-sorted rewrite systems, that would not terminate in the unsorted case. Expand
Termination of Term Rewriting by Interpretation
TLDR
A transformation on term rewriting systems eliminating distributive rules is introduced and a new termination proof of SUBST from [10] is given. Expand
Natural Termination
TLDR
Two techniques are examined for showing termination of rewrite systems when simpli cation ordering are insu cient, both of which allow the use of natural interpretations under which rules rewrite terms to terms of the same value. Expand
Simplification Orderings: Histrory of Results
  • J. Steinbach
  • Mathematics, Computer Science
  • Fundam. Informaticae
  • 1995
TLDR
An overview on different aspects of termination proof techniques for unconditional term rewriting systems using simplification orderings and a formalism that allows clear representations of orderings is introduced. Expand
Multiset Path Orderings and Their Application to Termination of Term Rewriting Systems
In this expository paper, a comprehensive study of multiset orderings, nested multiset orderings and multiset path orderings is presented. In particular, it is illustrated how multiset path orderingsExpand
A Termination Ordering for Higher Order Rewrite System
We present an extension of the recursive path ordering for the purpose of showing termination of higher order rewrite systems. Keeping close to the general path ordering of Dershowitz and Hoot, weExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 48 REFERENCES
Conflunt reductions: Abstract properties and applications to term rewriting systems
  • G. Huet
  • Computer Science
  • 18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
  • 1977
TLDR
This paper gives new results, and presents old ones in a unified formalism, concerning Church-Rosser theorems for rewriting systems, and shows how these results yield efficient methods for the mechanization of equational theories. Expand
A Note on Simplification Orderings
  • N. Dershowitz
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 1979
TLDR
A term-rewriting system P over a set of terms T is a finite set of rewrite rules of the form Q,(g) + ri(@, u here the & are variables ranging over I’. Expand
On the Halting of Tree Replacement Systems.
Abstract : A meta theorem is proved giving sufficient conditions for termination of tree replacement systems. This leads to a new proof methodology for proving termination of optimization techniques.Expand
REDUCE 2: A system and language for algebraic manipulation
TLDR
In its latest form, REDUCE provides a complete language for interactive symbol manipulation by computer in addition to increased facilities for the simplification of algebraic expressions. Expand
Proving termination with multiset orderings
TLDR
The multiset ordering enables the use of relatively simple and intuitive termination functions in otherwise difficult termination proofs, and is used to prove the termination of production systems, programs defined in terms of sets of rewriting rules. Expand
A Lemma Driven Automatic Theorem Prover for Recursive Function Theory
TLDR
The theorem prover permits no interaction once given a goal, but many aspects of its behavior are influenced by previously proved results, so its performance on difficult theorems can be radically improved by having it first prove relevant lemmas. Expand
On well-quasi-ordering finite trees
A new and simple proof is given of the known theorem that, if T 1 , T 2, … , is an infinite sequence of finite trees, then there exist i and j such that i < j and T i is homeomorphic to a subtree ofExpand
A users manual for FOL.
TLDR
This manual explains how to use of the proof checker FOL, and supersedes all previous manuals, to create an environment where formal proofs can be carefully examined. Expand
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
TLDR
An approach is presented for taking advantage of the structure of some special theories with simplifiers, commutativity, and associativity, which are valuable concepts to build in by means of a “natural” notation and/or new inference rules. Expand
Complete Sets of Reductions for Some Equational Theories
TLDR
The extension of the Knuth-Bendtx algorithm has produced complete sets of reductions for free commutattve groups, commutative rings wtth umt, and distributive lattices. Expand
...
1
2
3
4
5
...