Abstract
The Andorra model is a parallel execution model of logic programs which exploits the dependent and-parallelism and or-parallelism inherent in logic programming. We present a flat subset of a language based on the Andorra model, henceforth called Andorra Prolog, that is intended to subsume both Prolog and the committed choice languages. Flat Andorra, in addition todon’t know anddon’t care nondeterminism, supports control of or-parallel split, synchronisation on variables, and selection of clauses. We show the operational semantics of the language, and its applicability in the domain of committed choice languages. As an examples of the expressiveness of the language, we describe a method for communication between objects by time-stamped messages, which is suitable for expressing distributed discrete event simulation applications. This method depends critically on the ability to expressdon’t know nondeterminism and thus cannot easily be expressed in a committed choice language.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bahgat, R. and Gregory, S., “Pandorra: Nondeterministic Parallel Logic Programming,”Proc. 6th International Conference on Logic Programming, Lisbon MIT Press, 1989.
Brand, P. and Haridi, S., “Prolog for Discrete Simulation,”Research Report, SICS, 1988.
Broda, K. and Gregory, S., “Parlogs for Discrete Event Simulation,”Proceeding of the Second International Conference on Logic Programming, Uppsala, 1984.
Carlsson, M. and Widen, J., “SICStus Prolog user manual,”Research Report, SICS, 1988.
Clark, C. and Gregory S., “Parlog Parallel Programming in Logic,” inConcurrent Prolog Collected Papers, Shapiro, E. ed., MIT Press, 1987.
Colmerauer, A.,Prolog II: Manuel de reference et de modele theorique, G. I. A., University of Aix-Marseille, 1982.
Elshiewy, N., “Modular and Communicating Objects in SICStus Prolog,”Conference on Fifth Generation Computer Systems 1988, ICOT, 1988.
Gregory, S.,Personal Communication.
Haridi, S. and Brand, B., “Andorra Prolog,”Conference on Fifth Generation Computer Systems 1988, ICOT, 1988.
Hausman, B. et al., “Cut and Side-Effects in Or-Parallel Prolog,”Conference on Fifth Generation Computer Systems 1988, ICOT, 1988.
Von Hentryck, P.,Constraint Satisfaction Problems in Logic Programming, MIT Press, 1989.
Kornfeld, B. “Finite Domain Problems in Andorra,”Italian, Swedish Japanes workshop, Pisa, 1989.
Lusk, E. et al., “The Aurora OR-Parallel Prolog System,” inInternational Conference on Fifth Generation Computer Systems 1988, ICOT, 1988.
Misra, J., “Distributed Discrete-Event simulation,”Computing Surveys, Vol. 18, No. 1, ACM, 1986.
Naish, L., “Parallelizing NU-Prolog,” inLogic Programming, Proceeding of the International Conference and Symposium (Kowalski R. and Bowen, K. eds.) MIT Press, 1988.
Saraswat, V., “A somewhat logical formulation of CLP synchronisation primitives,” inLogic Programming, Proceeding of the Joint International Conference and Symposium (Kowalski, R. and Bowen, K. eds.), MIT Press, 1988.
Saraswat, V., “Concurrent Constraint Programming Languages,”Ph. D. Thesis, Carnegie Mellon University, 1989.
Shapiro, E.,Concurrent Prolog Collected Papers, MIT Press, 1988.
Zobel, T.,NU-Prolog Reference Manual 1987 Vers. 1.1 Technical Report, University of Melbourne, 1988.
Yang, R., “A Parallel Logic Programming Language and its Implementation,”Ph. D. Thesis, Keio University, 1986.
Author information
Authors and Affiliations
About this article
Cite this article
Haridi, S. A logic programming language based on the Andorra model. NGCO 7, 109–125 (1990). https://doi.org/10.1007/BF03037202
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF03037202