Event Logic Programming
We present a new concurrent (constraint) logic programming language based on partially ordered event structures. A system is modeled as: (a) a set of concurrent processes, which are Prolog programs extended with event goals declaring program points of interest, and (b) a constraint store which imposes restrictions on the event goals execution order. The constraint store acts as a coordination entity which on the one hand encapsulates the system synchronization requirements, and on the other hand, provides a declarative specification of the system concurrency issues. This produces a powerful formalism which at the same time, overcome the deficiencies of traditional concurrent logic programming languages and preserve the benefits of declarative programming.
KeywordsLogic Program Logic Programming Concurrent Process Event Goal Tuple Space
Unable to display preview. Download preview PDF.
- 3.S. Gregory.: Parallel Logic Programming in Parlog: The Language and Its Implementation. Addison-Wesley. 1987.Google Scholar
- 4.M. Hermenegildo, D. Cabeza, and M. Carro: Using attributed variables in the implementation of concurrent and parallel logic programming systems. Logic Programming, Proc. Twelfth Int. Conf. on Logic Programming. (1995) 631–645Google Scholar
- 7.V. A. Saraswat: Concurrent Constraint Programming. Logic Programming Series. MIT Press. 1992.Google Scholar
- 8.E.Y. Shapiro, editor: Concurrent Prolog: Collected Papers. MIT Press, 1987.Google Scholar
- 9.P. Tarau: Jinni: Intelligent mobile agent programming at the intersection of Java and Prolog. Proc. of PAAM’ 99. (1999)Google Scholar
- 10.K. Ueda: Guarded Horn clauses. E.Y. Shapiro, editor: Concurrent Prolog: Collected Papers. MIT Press. (1987) 140–156Google Scholar