On Termination of Binary CLP Programs

DOI10.1007/11506676_15MaRDI QIDQ5458805zbMATH OpenOpenAlexFDO

Authors Alexander Serebrenik, Fred Mesnard

Publication date 24 April 2008

Published in Logic Based Program Synthesis and Transformation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Logic programming (68N17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Termination of constraint logic programs
• Proof of termination of the rewriting system SUBSET on CCL
• A non-termination criterion for binary constraint logic programs
• scientific article; zbMATH DE number 2090534
• scientific article; zbMATH DE number 1497847
• Termination of semi-algebraic loop programs
• Program Development in Computational Logic
• scientific article; zbMATH DE number 2018591

Cited in

(2)

• Recurrence with affine level mappings is P-time decidable for CLP
• A new look at the automatic synthesis of linear ranking functions

This page was built for publication: On Termination of Binary CLP Programs

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