close
Skip to main content

Event Logic Programming

  • Conference paper
  • First Online:
Parallel Computing Technologies (PaCT 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2127))

Included in the following conference series:

  • 362 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. A. Brogi, P. Ciancarini: The concurrent language Shared Prolog. ACM Transactions on Programming Languages and Systems, 13(1), (1991), 99–123

    Article  Google Scholar 

  2. N. Carriero, D. Gelernter: Linda in context. Communications of the ACM. 32(4) (1989) 444–458

    Article  Google Scholar 

  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–645

    Google Scholar 

  5. R. A. Kowalski and M. J. Sergot.: A logic-based calculus of events. New Generation Computing 4 (1986) 67–95

    Article  Google Scholar 

  6. V. Pratt: Modeling concurrency with partial orders. Int. J. of Logic Programming, 15(1) (1986) 33–71

    MATH  MathSciNet  Google 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–156

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ramirez, R., Santosa, A.E. (2001). Event Logic Programming. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2001. Lecture Notes in Computer Science, vol 2127. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44743-1_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-44743-1_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42522-9

  • Online ISBN: 978-3-540-44743-6

  • eBook Packages: Springer Book Archive

Keywords

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.

Publish with us

Policies and ethics