A new approach to termination analysis of CHR

Abstract. We present a new approach to termination analysis of Con-straint 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 ar-gument based on the comparison of sizes of consecutive computation states. We demonstrate the condition’s applicability on a set of termi-nating CHR programs, using a prototype analyzer. This analyzer is the first in-language automated termination analyzer for CHR programs