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)

Semantic Scholar uses AI to extract papers important to this topic.

2009

2009

- Adam Koprowski
- Applicable Algebra in Engineering, Communicationâ€¦
- 2009

The recursive path ordering (RPO) is a well-known reduction ordering introduced by Dershowitz, that is useful for provingâ€¦Â (More)

Is this relevant?

2006

2006

- Adam Koprowski
- RTA
- 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

- Adam Koprowski, Hans Zantema
- IJCAR
- 2006

Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variantâ€¦Â (More)

Is this relevant?

2000

2000

- Cristina Borralleras, Maria Ferreira, Albert Rubio
- CADE
- 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

- Luca Maria Gambardella, Marco Dorigo
- INFORMS Journal on Computing
- 2000

We present a new local optimizer called SOP-3-exchange for the sequential ordering problem that extends a local search for 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?

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

- David Dollar
- 1998

The findings, interpretations, and conclusions expressed in this paper are entirely those of the authors. They do not necessarilyâ€¦Â (More)

Is this relevant?

1985

1985

- Mukkai S. Krishnamoorthy, Paliath Narendran
- Theor. Comput. Sci.
- 1985

The uniform termination property (sometimes called Noetherian property) is crucial to applying the Knuth-Bendix completionâ€¦Â (More)

Is this relevant?