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

DOI10.1017/S1471068407003122zbMath1128.68017OpenAlexW2095555925MaRDI QIDQ5437651

Alexander Serebrenik, Fred Mesnard

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

decidabilityterminationconstraint logic programming

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

On the Termination of Integer Loops, Dependency Triples for Improving Termination Analysis of Logic Programs with Cut, A new look at the automatic synthesis of linear ranking functions, Ranking Functions for Linear-Constraint Loops

Cites Work

• 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
• Unnamed Item
• Unnamed Item