Termination Analysis of CHR Revisited

DOI10.1007/978-3-540-89982-2_43zbMath1185.68176OpenAlexW1488160191MaRDI QIDQ5504676

Danny De Schreye, Paolo Pilozzi

Publication date: 22 January 2009

Published in: Logic Programming (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/184893

zbMATH Keywords

termination analysisconstraint handling rules

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (5)

Proving Termination by Invariance Relations ⋮ Automating Termination Proofs for CHR ⋮ Constraint handling rules with binders, patterns and generic quantification ⋮ Strong Joinability Analysis for Graph Transformation Systems in CHR ⋮ Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities

Cites Work

• Termination of rewriting
• Proving termination with multiset orderings
• Theory and practice of constraint handling rules
• Termination of logic programs: the never-ending story
• Logic Programming
• Logic Programming

This page was built for publication: Termination Analysis of CHR Revisited