Automating Termination Proofs for CHR
We propose a constraint-based approach towards automated termination analysis of Constraint Handling Rules (CHR). Similar to such approaches for Logic Programming (LP), we define a symbolic level mapping on atoms of the program and express termination conditions using these. Then, we search for an assignment to the symbolic coefficients, validating the termination conditions. However, different from the approaches developed for LP, termination of CHR programs is concerned with multi-headed rules, while the existing constraint-based approaches in LP are developed for definite programs. These cannot be adapted directly to a multi-headed context. In the following we discuss a constraint-based approach for CHR programs and show how such an approach can be obtained by an elegant reuse of existing techniques in LP. We evaluate the approach, using our implementation, CHRisTA.
KeywordsLogic Program Logic Programming Simple Genetic Algorithm Dependency Pair Recursive Program
Unable to display preview. Download preview PDF.
- 1.Frühwirth, T.: Proving Termination of Constraint Solver Programs. In: New Trends in Constraints, pp. 298–317 (2000)Google Scholar
- 7.Voets, D., Pilozzi, P., De Schreye, D.: A new approach to termination analysis of Constraint Handling Rules. In: Pre-proceedings LOPSTR 2008, pp. 28–42 (2008)Google Scholar