An algebraic perspective of constraint logic programming

Journal of Logic and Computation

Volumn 7, Issue 1, 1997, Pages 1-38

  De Boer, Frank S ^a   Di Pierro, Alessandra ^b   Palamidessi, Catuscia ^c  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF PISA   (Italy)

^c UNIVERSITY OF GENOA   (Italy)

Author keywords

Constraint logic programming; Cylindric algebras; Distributive lattices; Heyting negation; Negation as instantiation

Indexed keywords

EID: 0347929963     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/7.1.1     Document Type: Review

References (29)

1. S. Abramsky. Domain theory in logical form. In Proceedings of the Annual IEEE Symposium on Logic in Computer Science (LICS), pp. 47-53. IFFF, Ithaca, NY, 1987. Extended version in Annals of Pure and Applied Logic, 51, 1-77, 1991.
2. S. Abramsky. Domain theory in logical form. In Proceedings of the Annual IEEE Symposium on Logic in Computer Science (LICS), pp. 47-53. IFFF, Ithaca, NY, 1987. Extended version in Annals of Pure and Applied Logic, 51, 1-77, 1991.
3. K. R. Apt, H. Blair and A. Walker. Towards a theory of declarative knowledge. In Foundations of Deductive Databases and Logic Programming, J. Minker, ed. pp. 89-148. Morgan Kaufmann, Los Altos, CA, 1988.
4. P. Aczel. An introduction to inductive definitions. In Handbook of Mathematical Logic, J. Barwise, ed. pp. 739-782. North-Holland, Amsterdam, 1977.
5. E. Astesiano. Inductive and operational semantics. In Formal Description of Programming Concepts, IFIP State-of-the-Art Reports, E. J. Neuhold and M. Paul, eds. pp 51-136. Springer-Verlag, Berlin, 1991.
6. P. Cousot and R. Cousot. Inductive definitions, semantics and abstract interpretation. In Proceedings of the Annual ACM Symposium on Principles of Programming Languages (POPL), pp. 83-94. ACM, New York, 1992.
7. D. Chan. Constructive negation based on the completed database. In Proceedings of the International Con-ference on Logic Programming (ICLP), R. A. Kowalski and K. A. Bowen, eds. pp. 111-125. The MIT Press, Cambridge, MA, 1988.
8. K. L. Clark. Negation as failure. In Logic and Data Bases, H. Gallaire and J. Minker, eds. pp. 293-322. Plenum Press, New York, 1978.
9. F. S. de Boer, A. Di Pierro and C. Palamidessi. Nondeterminism and infinite computations in constraint programming. International Workshop on Topology and Completion in Semantics, Chartres, 1993. To appear in Theoretical Computer Science.
10. F. S. de Boer, M. Gabbrielli, E. Marchiori and C. Palamidessi. Proving concurrent constraint programs correct. In Proceedings of the Annual ACM Symposium on Principles of Programming Languages (POPL), pp. 98-108. ACM, New York, 1994.
11. A. Di Pierro, M. Martelli and C. Palamidessi. Negation as instantiation. Information and Computation, 120, 263-278, 1995.
12. A. Di Pierro and C. Palamidessi. A logical denotational semantics for constraint logic programming. In Proceedings of the European Symposium on Programming (ESOP), D. Sannella, ed. pp. 195-210. Vol. 788 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1994.
13. M. Falaschi, G. Levi, M. Martelli and C. Palamidessi. Declarative modeling of the operational behaviour of logic languages. Theoretical Computer Science, 69, 289-318, 1989.
14. M. Gabbrielli. The Semantics of Logic Programming as a Programming Language. PhD Thesis, Technical Report TD-17/93, Department of Computer Science, University of Pisa, Pisa, 1993.
15. M. Gabbrielli, G. M. Dore and G. Levi. Observable semantics for constraint logic programming. Journal of Logic and Computation, 5, 133-171,1995.
16. M. Gabbrielli and G. Levi. Modeling answer constraints in constraint logic programming. In Proceedings of the International Conference on Logic Programming (ICLP), K. Furukawa, ed. pp. 238-252. The MIT Press, Cambridge, MA, 1991.
17. G. Gierz, K. H. Hoffman, K. Keimel, J. D. Lawson and D. S. Scott. A Compendium of Continuous Lattices. Springer-Verlag, Berlin, Heidelberg, New York, 1980.
18. L. Henkin, J. D. Monk and A. Tarski. Cylindric Algebras (Part 1). North-Holland, Amsterdam, 1971.
19. J. Jaffar and J.-L. Lassez. Constraint logic programming. In Proceedings of the Annual ACM Symposium on Principles of Programming Languages (POPL), pp. 111-119. ACM, New York, 1987.
20. J. Maluszynski and T. Näslund. Fail substitutions for negation as failure. In Proceedings of the North American Conference on Logic Programming (NACLP), E. Lusk and R. Overbeck, eds. pp. 461-476. The MIT Press, Cambridge. MA, 1989.
21. G. Plotkin. A structured approach to operational semantics. Technical Report DAIMIFN-19, Computer Science Department, Aarhus University, 1981.
22. D. Scott. Domains for denotational semantics. In Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP). M. Nielsen and E. M.Schmidt, eds. pp. 577-613. Vol. 140 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1994.
23. E. Y. Shapiro. A subset of concurrent Prolog and its interpreter. Technical Report TR-003, Institute for New Generation Computer Technology, Tokyo, 1983.
24. J. C. Shepherdson. A sound and complete semantics for a version of negation as failure. Theoretical Computer Science, 65, 343-371, 1989.
25. V. A. Saraswat and M. Rinard. Concurrent constraint programming. In Proceedings of the Annual ACM Symposium on Principles of Programming Languages (POPL), pp. 232-245. ACM, New York, 1990.
26. V. A. Saraswat, M. Rinard, and P. Panangaden. Semantics foundations of concurrent constraint programming. In Proceedings of the Annual ACM Symposium on Principles of Programming Languages (POPL), pp. 333-353. ACM, New York, 1991.
27. M. H. van Emden and G. J. de Lucena. Predicate logic as language for parallel programming. In Logic Programming, K. L. Clark and S. A. Tarnlund, eds. pp. 189-198. Academic Press, London, 1982.
28. M. H. van Emden and R. A. Kowalski. The semantics of predicate logic as a programming language. Journal of ACM, 23, 733-742, 1976.
29. S. Vickers. Topology via Logic. Cambridge University Press, Cambridge, 1990.