Constraint satisfaction in distributed concurrent logic programming
From MaRDI portal
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.
Recommendations
Cited in
(12)- Distributed programming with logic tuple spaces
- Distributed reasoning for restricted weakly-linear disjunctive tuple-generating dependencies
- Distributed Abductive Reasoning with Constraints
- scientific article; zbMATH DE number 67481 (Why is no real title available?)
- scientific article; zbMATH DE number 1059301 (Why is no real title available?)
- scientific article; zbMATH DE number 1059303 (Why is no real title available?)
- scientific article; zbMATH DE number 1975621 (Why is no real title available?)
- scientific article; zbMATH DE number 2080332 (Why is no real title available?)
- Past and present (and future) of parallel and distributed computation in (constraint) logic programming
- scientific article; zbMATH DE number 2087249 (Why is no real title available?)
- SMTS: Distributed, Visualized Constraint Solving
- Levels of concurrency in constraint satisfaction problems with subdefinite objects
This page was built for publication: Constraint satisfaction in distributed concurrent logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365137)
