The semantics of constraint logic programs

Journal of Logic Programming

Volumn 37, Issue 1-3, 1998, Pages 1-46

  Jaffar, Joxan ^a   Maher, Michael ^b   Marriott, Kim ^c   Stuckey, Peter ^d  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b GRIFFITH UNIVERSITY   (Australia)

^c MONASH UNIVERSITY   (Australia)

^d UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; CONSTRAINT THEORY;

CONSTRAINT SOLVERS; LEMMAS; LITERAL SCHEDULING;

LOGIC PROGRAMMING;

EID: 0032187318     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(98)10002-X     Document Type: Article

References (24)

1. K.R. Apt, M.H. van Emden, Contributions to the theory of logic programming, Journal of the ACM 29 (3) (1982) 841-862.
2. K.L. Clark, Negation as failure, in: H. Gallaire, J. Minker (Eds.), Logic and Databases, Plenum Press, New York, 1978, pp. 293-322.
3. A. Colmerauer, Prolog-II Manuel de Reference at Modele Theorique, Groupe Intelligence Artificelle, Universite d'Aix-Marseille II, 1982.
4. M.H. van Emden, R.A. Kowalski, The semantics of predicate logic as a programming language, Journal of the ACM 23 (4) (1976) 733-742.
5. M. Falaschi, G. Levi, M. Martelli, C. Palamidessi, Declarative modeling of the operational behavior of logic languages, Theoretical Computer Science 69 (3) (1989) 289-318.
6. M. Gabbrielli, G. Levi, Modeling answer constraints in constraint logic programs, in: Proceedings of the Eighth International Conference on Logic Programming, 1991, pp. 238-252.
7. J. Jaffar, J.-L. Lassez, Constraint logic programming, Technical Report 86/73, Department of Computer Science, Monash University, 1986.
8. J. Jaffar, J.-L. Lassez, Constraint logic programming, in: Proceedings of the 14th Annual ACM Symposium, Principles of Programming Languages, 1987, pp. 111-119.
9. J. Jaffar, J.-L. Lassez, J.W. Lloyd, Completeness of the negation as failure rule, in: Proceedings of IJCAI-83, 1983, pp. 500-506.
10. J. Jaffar, J.-L. Lassez, M.J. Maher, A theory of complete logic programs with equality, The Journal of Logic Programming 3 (1984) 211-223.
11. J. Jaffar, M. Maher, Constraint logic programming: A survey, Journal of Logic Programming 19/20 (1994) 503-581.
12. J. Jaffar, S. Michaylov, P. Stuckey, R. Yap, The CLP(R) language and system, ACM Transactions on Programming Languages 14 (3) (1992) 339-395.
13. J. Jaffar, P. Stuckey, Semantics of infinite tree logic programming, Theoretical Computer Science 46 (1986) 141-158.
14. J. Jaffar, P. Stuckey, Canonical logic programs, Journal of Logic Programming 3 (1986) 143-155.
15. A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics 5 (1955) 285-309.
16. J.-L. Lassez, M.J. Maher, Closures and fairness in the semantics of programming logic, Theoretical Computer Science 29 (1984) 167-184.
17. J.W. Lloyd, Foundations of Logic Programming, 2nd ed., Springer, Berlin, 1987.
18. M. Maher, Logic semantics for a class of committed-choice programs, in: Proceedings of the Fourth International Conference on Logic Programming, MIT Press, Cambridge, MA, 1987, pp. 858-876.
19. A. Mal'cev, Axiomatizable classes of locally free algebras of various types, in: The Metamathematics of Algebraic Systems: Collected Papers 1936-1967, ch. 23, 1971, pp. 262-281.
20. K. Marriott, P. Stuckey, Programming with Constraints: An Introduction, MIT Press, Cambridge, MA, 1998.
21. E. Mendelson, Introduction to Mathematical Logic, Wadsworth and Brooks, 3rd ed., 1987.
22. J.R. Shoenfield, Mathematical Logic, Addison-Wesley, Reading, MA, 1967.
23. M. Wallace, A computable semantics for general logic programs, Journal of Logic Programming 6 (1989) 269-297.
24. D.A. Wolfram, M.J. Maher, J.-L. Lassez, A unified treatment of resolution strategies for logic programs, in: Proceedings of the Second International Conference on Logic Programming, Uppsala, 1984, pp. 263-276.