Skip to main content
    • Aa
    • Aa

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


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.

Hide All
F. N. Afrati , S. S. Cosmadakis and E. Foustoucos 2005. Datalog programs and their persistency numbers. ACM Transactions on Computational Logic (TOCL) 6 (3), 481518.

S. Basu , R. Pollack and M.-F. Roy 1996. On the combinatorial and algebraic complexity of quantifier elimination. Journal of the ACM 43 (6), 10021045.

M. Bezem 1993. Strong termination of logic programs. Journal of Logic Programming 15 (1&2), 7997.

J. Jaffar and M. J. Maher 1994. Constraint logic programming: A survey. Journal of Logic Programming 19/20, 503582.

J. Jaffar , M. J. Maher , K. Marriott and P. J. Stuckey 1998. The semantics of constraint logic programs. Journal of Logic Programming 37 (1–3), 146.

J. Renegar 1992. On the computational complexity and geometry of the first-order theory of the reals. Journal of Symbolic Computation 13 (3), 255352.

A. Tiwari 2004. Termination of linear programs. In Computer-Aided Verification, CAV, R. Alur and D. Peled , Eds. Lecture Notes on Computer Science, Vol. 3114. Springer, 7082.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Theory and Practice of Logic Programming
  • ISSN: 1471-0684
  • EISSN: 1475-3081
  • URL: /core/journals/theory-and-practice-of-logic-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *



Full text views

Total number of HTML views: 0
Total number of PDF views: 2 *
Loading metrics...

Abstract views

Total abstract views: 129 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 19th October 2017. This data will be updated every 24 hours.