Constraint Logic Programming with Dynamic Scheduling: A Semantics Based on Closure Operators

Information and Computation

Volumn 137, Issue 1, 1997, Pages 41-67

  Falaschi, Moreno ^a   Gabbrielli, Maurizio ^b   Marriott, Kim ^c   Palamidessi, Catuscia ^d  

^a UNIVERSITY OF UDINE   (Italy)

^b UNIVERSITY OF PISA   (Italy)

^c MONASH UNIVERSITY   (Australia)

^d UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346938544     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2638     Document Type: Article

References (15)

1. de Boer, F. S., and Palamidessi, C. (1991), A fully abstract model for concurrent constraint programming, in "PROC. TAPSOFT'91" (S. Abramsky and T. Maibaum, Eds.), Lecture Notes in Computer Science, Vol. 493, pp. 296-319, Springer-Verlag, Berlin.
2. de la Banda, M. G., Marriott, K., and Stuckey, P. (1995), Efficient analysis of logic programs with dynamic scheduling, in "Proc. Twelfth International Logic Programming Symposium" (J. Lloyd, Ed.), pp. 417-431, MIT Press, Cambridge, MA.
3. Debray, S., Gudemann, D., and Bigot, P. (1994), Detection and optimization of suspension-free logic programs, in "Proc. Eleventh International Logic Programming Symposium" (M. Bruynooghe, Ed.), pp. 487-504, MIT Press, Cambridge, MA.
4. Falaschi, M., Levi, G., Martelli, M., and Palamidessi, C. (1989), Declarative modeling of the operational behavior of logic languages, Theoret. Comput. Sci. 69 (3), 289-318.
5. Gabbrielli, M., Dore, G., and Levi, G. (1995), Observable semantics for constraint logic programs, J. Logic Comput. 5 (2), 133-171.
6. Gierz, G., Hofmann, K., Keimel, K., Lawson, J., Mislove, M., and Scott, D. (1980), "A Compendium of Continuous Lattices," Springer-Verlag, Berlin/New York.
7. Jaffar, J., and Lassez, J.-L. (1987), Constraint logic programming, in "Proc. Fourteenth Annual ACM Symp. on Principles of Programming Languages," pp. 111-119, ACM Press.
8. Jagadeesan, R., Shanbhogue, V., and Saraswat, V. (1991), "Angelic Non-Determinism in Concurrent Constraint Programming," Technical report, System Science Lab., Xerox PARC.
9. Marriott, K., de la Banda, M. G., and Hermenegildo, M. (1994), Analyzing logic programs with dynamic scheduling, in "Proc. 21st Annual ACM Symp. on Principles of Programming Languages," pp. 240-253, ACM Press.
10. Naish, L. (1986), "Negation and Control in Prolog," Lecture Notes in Computer Science, Vol. 238, Springer-Verlag, Berlin.
11. Naish, L. (1992), "Coroutining and the Construction of Terminating Logic Programs," Technical Report 92/5, Department of Computer Science, University of Melbourne.
12. Saraswat, V. A. (1989), Concurrent constraint programming languages, Ph.D. thesis, Carnegie-Mellon University.
13. Saraswat, V. A., Rinard, M., and Panangaden, P. (1991), Semantic foundation of concurrent constraint programming, in "Proc. Eighteenth Annual ACM Symp. on Principles of Programming Languages," pp. 333-353, ACM Press.
14. van Emden, M. H., and Kowalski, R. A. (1976), The semantics of predicate logic as a programming language, J. ACM 23 (4), 733-742.
15. Yelick, K., and Zachary, J. (1989), Moded type systems for logic programming, in "Proc. Sixteenth Annual ACM Symp. on Principles of Programming Languages," pp. 116-124, ACM Press.