On proving left termination of constraint logic programs

DOI10.1145/635499.635503zbMATH Open1365.68151OpenAlexW1999783590MaRDI QIDQ5267429FDOQ5267429

Authors: Fred Mesnard, Salvatore Ruggieri 

Publication date: 13 June 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/635499.635503

Recommendations

• Termination of constraint logic programs
• Static Analysis
• The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
• CLP(χ) for automatically proving program properties1An earlier version of this paper was presented at the workshop “Frontiers of Combining Systems”, Munich, March 1996.1
• scientific article; zbMATH DE number 1140685

zbMATH Keywords

constraint logic programmingautomatic termination analysisleft terminationtermination inference

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (5)

• A non-termination criterion for binary constraint logic programs
• Recurrence with affine level mappings is P-time decidable for CLP
• Leaving Traces: A Note on a Sound and Complete Trace Logic for Concurrent Constraint Programs
• Static Analysis
• Termination of constraint logic programs

This page was built for publication: On proving left termination of constraint logic programs

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