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… (More)
DOI: 10.1007/978-3-642-02846-5_43


1 Figure or Table


Citations per Year

Citation Velocity: 4

Averaging 4 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Slides referencing similar topics