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.

2015

2015

- FrÃ©dÃ©ric Blanqui, Jean-Pierre Jouannaud, Albert Rubio
- Logical Methods in Computer Science
- 2015

This paper aims at carrying out termination proofs for simply typed higherorder calculi automatically by using orderingâ€¦Â (More)

Is this relevant?

2007

2007

- Jean-Pierre Jouannaud, Albert Rubio
- J. ACM
- 2007

This article extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining aâ€¦Â (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?

2002

2002

- Cristina Borralleras, Salvador Lucas, Albert Rubio
- CADE
- 2002

Context-sensitive rewriting (CSR) is a simple restriction of rewriting which can be used e.g. for modelling non-eager evaluationâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Thomas Arts, JÃ¼rgen Giesl
- Theor. Comput. Sci.
- 2000

We present techniques to prove termination and innermost termination of term rewriting systems automatically. In contrast toâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Jean-Pierre Jouannaud, Albert Rubio
- LICS
- 1999

This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting theâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Hans Zantema
- Fundam. Inform.
- 1995

A new kind of transformation of TRS's is proposed, depending on a choice for a model for the TRS. The labelled TRS is obtainedâ€¦Â (More)

Is this relevant?

1995

1995

- Andreas Weiermann
- Theor. Comput. Sci.
- 1995

It is shown that a termination proof for a term rewriting system using a lexicographic path ordering yields a multiply recursiveâ€¦Â (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?