Pre-proceedings of the 18th International Symposium on Logic-Based Program Synthesis and Transformation pages:28-42
International Symposium on Logic-Based Program Synthesis and Transformation edition:18 date:17-18 July 2008
We present a new approach to termination analysis of Constraint Handling Rules (CHR). Unlike current approaches, our approach has no restrictions on the kind of rules in the CHR program. We propose a termination condition that verifies conditions imposed on the dynamic process of adding constraints to the store, instead of a termination argument based on the comparison of sizes of consecutive computation states. We demonstrate the condition's applicability on a set of terminating CHR programs, using a prototype analyzer. This analyzer is the first in-language automated termination analyzer for CHR programs.