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.