Path ordering

Known as: Recursive path ordering, MPO, Lexicographic path ordering 
In theoretical computer science, in particular in term rewriting, a path ordering is a well-founded strict total order (>) on the set of all terms… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2017
05010019772017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
The recursive path ordering (RPO) is a well-known reduction ordering introduced by Dershowitz, that is useful for proving… (More)
  • figure 1.1
  • table 3.1
  • table 3.2
  • table 3.3
  • figure 6.1
Is this relevant?
2006
2006
Recursive path ordering (RPO) is a well-known reduction ordering introduced by Dershowitz [6], that is useful for proving… (More)
Is this relevant?
2006
2006
Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant… (More)
Is this relevant?
2006
2006
Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant… (More)
Is this relevant?
2000
2000
Although theoretically it is very powerful, the semantic path ordering (SPO) is not so useful in practice, since its monotonicity… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We present a new local optimizer called SOP-3-exchange for the sequential ordering problem that extends a local search for the… (More)
  • figure 3
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
1999
1999
A usual technique in symbolic constraint solving is to apply transformation rules until a solved form is reached for which the… (More)
Is this relevant?
1999
1999
A usual technique in symbolic constraint solving is to apply transformation rules until a solved form is reached for which the… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The findings, interpretations, and conclusions expressed in this paper are entirely those of the authors. They do not necessarily… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
1985
1985
The uniform termination property (sometimes called Noetherian property) is crucial to applying the Knuth-Bendix completion… (More)
Is this relevant?