Recurrence with affine level mappings is P-time decidable for CLP

DOI10.1017/S1471068407003122MaRDI QIDQ5437651zbMATH OpenOpenAlexFDO

Authors Fred Mesnard, Alexander Serebrenik

Publication date 21 January 2008

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s1471068407003122

zbMATH Keywords

constraint logic programmingdecidabilitytermination

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• On Termination of Binary CLP Programs
• Termination of constraint logic programs
• Polynomial time termination and constraint satisfaction tests
• Termination of linear programs with nonlinear constraints
• On proving left termination of constraint logic programs

Cites work

• scientific article; zbMATH DE number 1312992 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)
• On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals

Cited in

(5)

• On the termination of integer loops
• Dependency triples for improving termination analysis of logic programs with cut
• Ranking functions for linear-constraint loops
• Termination analysis of programs with multiphase control-flow
• A new look at the automatic synthesis of linear ranking functions

This page was built for publication: Recurrence with affine level mappings is P-time decidable for CLP

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