Star Games and Hydras

by   Jörg Endrullis, et al.

The recursive path ordering is an established and crucial tool in term rewriting to prove termination. We revisit its presentation by means of some simple rules on trees equipped with a `star' as control symbol, signifying a command to make that tree (or term) smaller in the order being defined. This leads to star games that are very convenient for proving termination of many rewriting tasks. For instance, using already the simplest star game on finite unlabeled trees, we obtain a very direct proof of termination of the famous Hydra battle. We also include an alternative road to setting up the star games, using a proof method of Buchholz, and a quantitative version of the star as control symbol. We conclude with a number of questions and future research directions.



There are no comments yet.


page 20

page 21


DefunT: A Tool for Automating Termination Proofs by Using the Community Books (Extended Abstract)

We present a tool that automates termination proofs for recursive defini...

Games for Succinctness of Regular Expressions

We present a version of so called formula size games for regular express...

STAR-RT: Visual attention for real-time video game playing

In this paper we present STAR-RT - the first working prototype of Select...

Evaluating Ordering Strategies of Star Glyph Axes

Star glyphs are a well-researched visualization technique to represent m...

A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity

Robin Milner (1984) gave a sound proof system for bisimilarity of regula...

Sparse Tiling through Overlap Closures for Termination of String Rewriting

We over-approximate reachability sets in string rewriting by languages d...

Ackermann's Function in Iterative Form: A Proof Assistant Experiment

Ackermann's function can be expressed using an iterative algorithm, whic...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.