🤖 AI Summary
This paper addresses the modeling and termination proof of the “Hercules vs. Hydra” game in rewriting systems with AC (associative-commutative) symbols. To overcome the limitation of prior work—which fails to capture all winning strategies for Hercules—the authors introduce the first formal encoding that **fully characterizes arbitrary winning strategies** for Hercules. They devise an **AC-compatible weak multiset path ordering (AC-MPO)**, enhanced with semantic annotations and type-based techniques, enabling fine-grained control over AC rewriting behavior. This framework yields the first **rigorous proof of strong normalization** for the encoded game within the AC setting. Consequently, *all* Hercules-winning derivations are representable, and termination is formally verifiable. The approach establishes a new paradigm for studying strategy completeness and provable termination in AC rewriting systems. (149 words)
📝 Abstract
We present a new encoding of the Battle of Hercules and Hydra as a rewrite system with AC symbols. Unlike earlier term rewriting encodings, it faithfully models any strategy of Hercules to beat Hydra. To prove the termination of our encoding, we employ type introduction in connection with many-sorted semantic labeling for AC rewriting and AC-MPO, a new AC compatible reduction order that can be seen as a much weakened version of AC-RPO.