A logic programming language based on the Andorra model |
| |
Authors: | Seif Haridi |
| |
Affiliation: | 1. Swedish Institute of Computer Science, Box 1263, 164 28, Kista, Sweden
|
| |
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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|