Automating Termination Proofs for CHR

DOI10.1007/978-3-642-02846-5_43zbMath1251.68067OpenAlexW146100567MaRDI QIDQ5325775

Paolo Pilozzi, Danny De Schreye

Publication date: 24 July 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-02846-5_43

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• Deriving descriptions of possible values of program variables by means of abstract interpretation
• Theory and practice of constraint handling rules
• Logic Programming
• Termination Analysis of Logic Programs Based on Dependency Graphs
• Termination Analysis of CHR Revisited

This page was built for publication: Automating Termination Proofs for CHR