Constraint satisfaction in distributed concurrent logic programming (Q2365137)

The authors consider the algorithms for distributed constraint satisfaction problem in the framework of real numbers and Boolean rings. For this a prototype distributed concurrent constraints logic programming language D/C-Parlog is used. ln case of the network consisting, of one node the presented algorithms reduce to existing centralised constraint satisfaction algorithms, such as in \(\text{CLP}(R)\) and CHIP. The paper contains also implementation issues.