Prolog with communicating processes: from T-Prolog to CSR-Prolog
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
A distributed arc-consistency algorithm
Science of Computer Programming - Special issue on concurrent constraint programming
Communicating sequential processes
Communications of the ACM
Algorithms for Distributed Constraint Satisfaction: A Review
Autonomous Agents and Multi-Agent Systems
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
IEEE Transactions on Knowledge and Data Engineering
Asynchronous Search with Aggregations
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Interleaved Backtracking in Distributed Constraint Networks
ICTAI '01 Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence
Parallel and Distributed Finite Constraint Satisfaction: Complexity, Algorithms and Experiments
Parallel and Distributed Finite Constraint Satisfaction: Complexity, Algorithms and Experiments
Communicating sequential processes for distributed constraint satisfaction
Information Sciences: an International Journal
| Hi-index | 0.00 |
CSPCONS is a programming language that supports program execution over multiple Prolog processes with constraints. The language is an extended version of Csp-ii, a version of Prolog that supports, among other features, channel-based communicating processes and TCP/IP communication and is based on the CSP model introduced by Hoare. CSPCONS inherits all the advanced features of Csp-ii and extends it by introducing constraint solving capabilities to the processes. In CSPCONS each Prolog process has one or more solvers attached and each solver is independent from the others, following the original Csp-ii model, thus resulting to a communicating sequential constraint logic programming system. Such a model can facilitate greatly the implementation of distributed CLP applications. Currently CSPCONS offers a finite domain constraint solver, but the addition of new solvers is supported as they can be integrated in the system in the form of linkable C libraries. This paper briefly describes the original CSP-II system along with the extensions that resulted to the CSPCONS system.