Skip to main content

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
Cancel
×
Home
Article
    • Aa
    • Aa
  • Cited by 5
  • Cited by
    Crossref Citations
    Crossref logo
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Maurica, Fonenantsoa Mesnard, Frédéric and Payet, Étienne 2016. Static Analysis.

    Ben-Amram, Amir M. 2014. The Hardness of Finding Linear Ranking Functions for Lasso Programs. Electronic Proceedings in Theoretical Computer Science, Vol. 161, p. 32.

    Ben-Amram, Amir M. and Genaim, Samir 2013. On the linear ranking problem for integer linear-constraint loops. ACM SIGPLAN Notices, Vol. 48, Issue. 1, p. 51.

    Bagnara, Roberto Mesnard, Fred Pescetti, Andrea and Zaffanella, Enea 2012. A new look at the automatic synthesis of linear ranking functions. Information and Computation, Vol. 215, p. 47.

    Ströder, Thomas Schneider-Kamp, Peter and Giesl, Jürgen 2011. Logic-Based Program Synthesis and Transformation.

    ×
  • Get access
    Add to cart $35.00
    Check if you have access via personal or institutional login
    Log in Register Recommend to librarian

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

  • FRED MESNARD (a1) and ALEXANDER SEREBRENIK (a2)
Abstract
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.

Copyright
COPYRIGHT: © Cambridge University Press 2007
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

F. N. Afrati , S. S. Cosmadakis and E. Foustoucos 2005. Datalog programs and their persistency numbers. ACM Transactions on Computational Logic (TOCL) 6 (3), 481–518.
S. Basu , R. Pollack and M.-F. Roy 1996. On the combinatorial and algebraic complexity of quantifier elimination. Journal of the ACM 43 (6), 1002–1045.
M. Bezem 1993. Strong termination of logic programs. Journal of Logic Programming 15 (1&2), 79–97.
J. Jaffar and M. J. Maher 1994. Constraint logic programming: A survey. Journal of Logic Programming 19/20, 503–582.
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), 1–46.
J. Renegar 1992. On the computational complexity and geometry of the first-order theory of the reals. Journal of Symbolic Computation 13 (3), 255–352.
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, 70–82.
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? *

CAPTCHA *

Skip to the audio challenge
×

Keywords:

Metrics

Full text views

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

Abstract views

Total abstract views: 115 *
Loading metrics...

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

Cancel
Confirm
×