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 from the original one by labelling operation symbols, possibly creatingâ€¦ (More)

We investigate proving termination of term rewriting systems by interpretation of terms in a well-founded monotone algebra. The well-known polynomial interpretations can be considered as a particularâ€¦ (More)

We present a new method for automatically proving termination of term rewriting. It is based on the well-known idea of interpretation of terms where every rewrite step causes a decrease, but insteadâ€¦ (More)

Context-sensitive term rewriting is a kind of term rewriting in which reduction is not allowed inside some xed arguments of some function symbols. We introduce two new techniques for provingâ€¦ (More)

Since 2004, a Termination Competition is organized every year. This competition boosted a lot the development of automatic termination tools, but also the design of new techniques for provingâ€¦ (More)

In this paper we investigate the concept of simple termination. A term rewriting system (TRS for short) is called simply terminating if its termination can be proved by means of a simplificationâ€¦ (More)

We introduce a transformation of well-moded logic programs into constructor systems, a subclass of term rewrite systems, such that left-termination of the logic program follows from termination ofâ€¦ (More)

There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called binary decisionâ€¦ (More)