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

Theory and Practice of Logic Programming

Volumn 8, Issue 1, 2008, Pages 111-119

  Mesnard, Fred ^a   Serebrenik, Alexander ^b  

^a UNIVERSITÉ DE LA RÉUNION   (France)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Constraint logic programming; Decidability; Termination

Indexed keywords

COMPUTABILITY AND DECIDABILITY; CONSTRAINT THEORY; POLYNOMIALS;

AFFINE LEVEL MAPPINGS; CONSTRAINT LOGIC PROGRAMMING; POLYNOMIAL TIME; TERMINATION;

LOGIC PROGRAMMING;

EID: 36849039971     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068407003122     Document Type: Article

References (23)

1. AFRATI, F. N., COSMADAKIS, S. S. AND FOUSTOUCOS, E. 2005. Datalog programs and their persistency numbers. ACM Transactions on Computational Logic (TOCL), 6(3), 481-518.
2. BASU, S., POLLACK, R. AND ROY, M.-F. 1996. On the combinatorial and algebraic complexity of quantifier elimination. Journal of the ACM 43(6), 1002-1045.
3. BEZEM, M. 1993. Strong termination of logic programs. Journal of Logic Programming 15(1&2), 79-97.
4. COLLINS, G. E. 1975. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Second GI Conference on Automata Theory and Formal Languages. Lecture Notes in Computer Science, Vol. 33. Springer, 134-183.
5. COUSOT, P. 2005. Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming. In Verification, Model Checking, and Abstract Interpretation, 6th International Conference, VMCAI, Paris, France, January 17-19, 2005, Proceedings, R. Cousot, Ed. Lecture Notes in Computer Science, Vol. 3385. Springer, 1-24.
6. DANTZIG, G. B. 1951. Maximization of a linear function of variables subject to linear inequalities. In Activity Analysis of Production and Allocation - Proceedings of a Conference, T. Koopmans, Ed. Cowles Commission Monograph, Vol. 13. Wiley, New York, 339-347.
7. DEVIENNE, P., LEBÈGUE, P. AND ROUTIER, J.-C. P. 1993. Halting problem of one binary horn clause is undecidable. In STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings., P. Enjalbert, A. Finkel and K. W. Wagner, Eds. Lecture Notes in Computer Science, Vol. 665. Springer, 48-57.
8. HOLZBAUR, C. 1995. OFAI clp(Q,R) Manual. Tech. Rep. TR-95-09, Austrian Research Institute for Artificial Intelligence (ÖFAI), Schottengasse 3, A-1010 Vienna, Austria.
9. JAFFAR, J. AND MAHER, M. J. 1994. Constraint logic programming: A survey. Journal of Logic Programming 19/20, 503-582.
10. JAFFAR, J., MAHER, M. J., MARRIOTT, K. AND STUCKEY, P. J. 1998. The semantics of constraint logic programs. Journal of Logic Programming 37(1-3), 1-46.
11. KHACHIYAN, L. 1979. A polynomial algorithm in linear programming. Soviet Mathematics - Doklady 20, 191-194.
12. MARCINKOWSKI, J. 1996. DATALOG SIRUPs uniform boundedness is undecidable. In Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science. 13-24.
13. MARRIOTT, K. AND STUCKEY, P. J. 1998. Programming With Constraints: An Introduction. The MIT Press.
14. PHEIDAS, T. 2000. An effort to prove that the existential theory of Q is undecidable. In Hilbert's Tenth Problem: Relations with Arithmetic and Algebraic Geometry, J. Denef, L. Lipshitz, T. Pheidas and J. V. Geel, Eds. Contemporary Mathematics 270, 237-252. American Mathematic Society, 2000. MR 2001m:03085.
15. PODELSKI, A. AND RYBALCHENKO, A. 2004. A complete method for the synthesis of linear ranking functions. In Verification, Model Checking, and Abstract Interpretation, 5th International Conference, Venice, January 11-13, 2004, Proceedings, B. Steffen and G. Levi, Eds. Lecture Notes in Computer Science, Vol. 2937. Springer, 239-251.
16. RENEGAR, J. 1992. On the computational complexity and geometry of the first-order theory of the reals. Journal of Symbolic Computation 13(3), 255-352.
17. SCHRIJVER, A. 1986. Theory of Linear and Integer Programming. Wiley.
18. SEREBRENIK, A. AND MESNARD, F. 2004. On termination of binary CLP programs. In Logic Based Program Synthesis and Transformation, 14th International Symposium, LOPSTR, Verona, Italy, August 26-28, 2004, Revised Selected Papers, S. Etalle, Ed. Lecture Notes in Computer Science, Vol. 3573. Springer, 231-244.
19. SICS. 2005. SICStus User Manual. Version 3.12.3. Swedish Institute of Computer Science.
20. SOHN, K. AND VAN GELDER, A. 1991. Termination detection in logic programs using argument sizes. In Proceedings of the Tenth ACM SIGACT-SIGART-SIGMOD Symposium on Principles of Database Systems. ACM Press, 216-226.
21. TARSKI, A. 1931. Sur les ensembles définissables de nombres réels. Fundamenta Mathematicae 17, 210-239.
22. TARSKI, A. 1951. A Decision Method for Elementary Algebra and Geometry, 2nd ed. University of California Press.
23. TIWARI, A. 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.