Event Logic Programming

  • Rafael Ramirez
  • Andrew E. Santosa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2127)


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.


Logic Program Logic Programming Concurrent Process Event Goal Tuple Space 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. Brogi, P. Ciancarini: The concurrent language Shared Prolog. ACM Transactions on Programming Languages and Systems, 13(1), (1991), 99–123CrossRefGoogle Scholar
  2. 2.
    N. Carriero, D. Gelernter: Linda in context. Communications of the ACM. 32(4) (1989) 444–458CrossRefGoogle Scholar
  3. 3.
    S. Gregory.: Parallel Logic Programming in Parlog: The Language and Its Implementation. Addison-Wesley. 1987.Google Scholar
  4. 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
  5. 5.
    R. A. Kowalski and M. J. Sergot.: A logic-based calculus of events. New Generation Computing 4 (1986) 67–95CrossRefGoogle Scholar
  6. 6.
    V. Pratt: Modeling concurrency with partial orders. Int. J. of Logic Programming, 15(1) (1986) 33–71zbMATHMathSciNetGoogle Scholar
  7. 7.
    V. A. Saraswat: Concurrent Constraint Programming. Logic Programming Series. MIT Press. 1992.Google Scholar
  8. 8.
    E.Y. Shapiro, editor: Concurrent Prolog: Collected Papers. MIT Press, 1987.Google Scholar
  9. 9.
    P. Tarau: Jinni: Intelligent mobile agent programming at the intersection of Java and Prolog. Proc. of PAAM’ 99. (1999)Google Scholar
  10. 10.
    K. Ueda: Guarded Horn clauses. E.Y. Shapiro, editor: Concurrent Prolog: Collected Papers. MIT Press. (1987) 140–156Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Rafael Ramirez
    • 1
  • Andrew E. Santosa
    • 1
  1. 1.School of ComputingNational University of SingaporeSingapore

Personalised recommendations