Event Logic Programming

Authors:
Rafael Ramirez;Andrew E. Santosa
Affiliations:
-;-
Venue:
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Year:
2001

Citing 8
Cited 0

A logic-based calculus of events

New Generation Computing
Modeling concurrency with partial orders

International Journal of Parallel Programming
Parallel logic programming in PARLOG: the language and its implementation

Parallel logic programming in PARLOG: the language and its implementation
Guarded horn clauses

Concurrent Prolog
Linda in context

Communications of the ACM
The concurrent language, Shared Prolog

ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent constraint programming

Concurrent constraint programming
Concurrent PROLOG: Collected Papers

Concurrent PROLOG: Collected Papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wepresent 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.