A Distributed and Probabilistic Concurrent Constraint Programming Language

We present a version of the CCP paradigm, which is both distributed and probabilistic. We consider networks with a fixed number of nodes, each of them possessing a local and independent constraint store. While locally the computations evolve asynchronously, following the usual rules of (probabilistic) CCP, the communications among different nodes are synchronous. There are channels, and through them different objects can be exchanged: constraints, agents and channel themselves. In addition, all this activities are embedded in a probabilistic scheme based on a discrete model of time, both locally and globally. Finally we enhance the language with the capability of performing an automatic remote synchronization of variables belonging to different constraint stores.

• Type: Conference
• Year: 2005
• Where: ICLP
• Authors: Luca Bortolussi, Herbert Wiklicky
• Keywords: CCP Paradigm, Constraint Stores, ICLP 2005, Independent Constraint Store, Programming Languages