Complexity:Old

This page is to record the current status of discussion on the proposed Complexity Category of the Termination Competition.

(Discussion should take place on the termtools mailing list.)

Overview of the Event

It is a challenging topic to automatically determine upper bounds on the complexity of rewrite systems. By complexity of a TRS, we mean the maximal length of derivations, where either no restrictions on the initial terms are present ("derivational complexity") or only constructor based terms are considered ("runtime complexity"). See (Hirokawa, Moser, 2008) for further reading on the notion of runtime complexity. Additionally one distinguishes between complexities induced by full rewriting as opposed to complexities induced by specific strategies, as for example innermost rewriting.

Syntax/Semantics for Input/Output

(to be extended)

Scoring

(to be extended)

Problem selection

(to be extended)

Participation

The sources of all tools that want to participate in the competition have to be publicly available.

Wishlist

(to be extended)

Questions

issues with the rules proposal that need to be clarified, or voted upon.

Participants

insert your name here if you intend to participate

• Johannes Waldmann (Matchbox), but will need more time (December 2008)
• M. Avanzini, G. Moser, A. Schnabl (TCT)