Recurrence with affine level mappings is p-time decidable for clp$({\mathbb r})$

Authors:
Fred Mesnard;Alexander Serebrenik
Affiliations:
Iremia, université de la réunion, france (email: frederic.mesnard@univ-reunion.fr);Laboratory for quality software (laquso), t.u. eindhoven, the netherlands (email: a.serebrenik@tue.nl)
Venue:
Theory and Practice of Logic Programming
Year:
2008

Citing 11
Cited 8

Theory of linear and integer programming

Theory of linear and integer programming
Termination detection in logic programs using argument sizes (extended abstract)

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the computational complexity and geometry of the first-order theory of the reals. Par I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals

Journal of Symbolic Computation
Strong termination of logic programs

Journal of Logic Programming
On the combinatorial and algebraic complexity of quantifier elimination

Journal of the ACM (JACM)
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Halting Problem of One Binary Horn Clause is Undecidable

STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
DATALOG SIRUPs uniform boundedness is undecidable

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Datalog programs and their persistency numbers

ACM Transactions on Computational Logic (TOCL)
Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
On termination of binary CLP programs

LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation

Automated termination proofs for logic programs by term rewriting

ACM Transactions on Computational Logic (TOCL)
A termination analyzer for Java bytecode based on path-length

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automated termination analysis for logic programs with cut*

Theory and Practice of Logic Programming
Dependency triples for improving termination analysis of logic programs with cut

LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
On the termination of integer loops

VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
A new look at the automatic synthesis of linear ranking functions

Information and Computation
On the Termination of Integer Loops

ACM Transactions on Programming Languages and Systems (TOPLAS)
On the linear ranking problem for integer linear-constraint loops

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we introduce a class of constraint logic programs such that their termination can be proved by using affine level mappings. We show that membership to this class is decidable in polynomial time.