Termination Analysis of CHR Revisited

Authors:
Paolo Pilozzi;Danny Schreye
Affiliations:
Dept. of Computer Science, K.U.Leuven, Belgium;Dept. of Computer Science, K.U.Leuven, Belgium
Venue:
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Year:
2008

Citing 5
Cited 4

Termination of rewriting

Journal of Symbolic Computation
Proving termination with multiset orderings

Communications of the ACM
Proving Termination of Constraint Solver Programs

Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Optimal Placement of Base Stations in Wireless Indoor Telecommunication

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Analyses, optimizations and extensions of constraint handling rules: ph.d. summary

ICLP'05 Proceedings of the 21st international conference on Logic Programming

Analysing graph transformation systems through constraint handling rules

Theory and Practice of Logic Programming
A transformational approach for proving properties of the CHR constraint store

LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
Improved termination analysis of CHR using self-sustainability analysis

LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Probabilistic termination of CHRiSM programs

LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Today, two distinct direct approaches to prove termination of CHR programs exist. The first approach, by T. Frühwirth , proves termination of CHR programs without propagation. The second, by Voets et al. , deals with programs that contain propagation. It is however less powerful on programs without propagation. In this paper, we present new termination conditions that are strictly more powerful than those from previous approaches and that are also applicable to a new class of programs. Furthermore, we present a new representation for CHR states for which size-decreases between consecutive states correspond to termination. Both contributions are linked: our termination conditions correspond to the existence of a well-founded order on the new state representation, which decreases for consecutive computation states.