Franzén, Torkel (1994) Some Formal Aspects of AKL. [SICS Report]
The Agents Kernel Language allows committed choice programming as well as nondeterministic logic programming based on the Andorra principle (and combinations of these), with a considerable degree of parallelism. In the present report the AKL computation model is formally defined and soundness and completeness results for a logical subset of AKL are presented. The computation model is extended to cover ports, a medium of communication used in AKL, and the solution collecting operation bagof. These extensions preserve the basic character of the computation model, and in particular the role played by the constraint theory. Declarative interpretations of these constructs are introduced, and the limitations of these readings are discussed. Finally, the confluence of strongly fair (possibly infinite) computations in a different subset of AKL is proved.
|Item Type:||SICS Report|
|Uncontrolled Keywords:||concurrent constraint programming, logic programming|
|Deposited By:||Vicki Carleson|
|Deposited On:||22 Oct 2007|
|Last Modified:||18 Nov 2009 16:00|
Repository Staff Only: item control page