Termination Analysis of CHR Revisited

DOI10.1007/978-3-540-89982-2_43MaRDI QIDQ5504676zbMATH OpenOpenAlexFDO

Authors Paolo Pilozzi, Danny De Schreye

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

constraint handling rulestermination analysis

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Automating Termination Proofs for CHR
• Proving Termination by Invariance Relations
• Improved Termination Analysis of CHR Using Self-sustainability Analysis
• Probabilistic termination of CHRiSM programs
• A Transformational Approach for Proving Properties of the CHR Constraint Store

Cites work

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

Cited in

(8)

• Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities
• Constraint handling rules with binders, patterns and generic quantification
• scientific article; zbMATH DE number 7047281 (Why is no real title available?)
• Improved Termination Analysis of CHR Using Self-sustainability Analysis
• Probabilistic termination of CHRiSM programs
• Strong Joinability Analysis for Graph Transformation Systems in CHR
• Proving Termination by Invariance Relations
• Automating Termination Proofs for CHR

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504676)