Concurrent and Reactive Constraint Programming

The Italian Logic Programming community has given several contributions to the theory of Concurrent Constraint Programming. In particular, in the topics of semantics, verification, and timed extensions. In this paper we review the main lines of research and contributions of the community in this field. 1 The origins: from concurrect logic programming to concurrent constraint programming In the 80's there had been several proposals to extend logic programming with constructs for concurrency, aiming at the development of a concurrent language which would maintain the typical advantages of logic programming: declarative reading, computations as proofs, amenability to meta-programming etc. Examples of concurrent logic languages include PARLOG [14], Concurrent Prolog [58, 59], Guarded Horn Clauses (GHC) [61, 62] and their so-called flat versions. Towards the end of the decade, Concurrent constraint programming ([52, 56, 57]) emerged as one of the most successful proposals in this area....

• Type: Journal
• Year: 2010
• Where: AGP
• Authors: Maurizio Gabbrielli, Catuscia Palamidessi, Frank D. Valencia
• Keywords: AGP 2010, Artificial Intelligence, Concurrent Constraint, Logic Programming, Programming