Communicating sequential processes
Communicating sequential processes
Arc consistency: parallelism and domain dependence
Artificial Intelligence - Special volume on constraint-based reasoning
Prolog with communicating processes: from T-Prolog to CSR-Prolog
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Arc-consistency and arc-consistency again
Artificial Intelligence
An overview of the design of Distributed Oz
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
A distributed arc-consistency algorithm
Science of Computer Programming - Special issue on concurrent constraint programming
Chaotic iteration for distributed constraint propagation
Proceedings of the 1999 ACM symposium on Applied computing
Efficient logic variables for distributed computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating sequential processes
Communications of the ACM
Optimal Distributed Arc-Consistency
Constraints
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
ExperNet: An Intelligent Multiagent System for WAN Management
IEEE Intelligent Systems
CSPCONS: A Communicating Sequential Prolog with Constraints
SETN '02 Proceedings of the Second Hellenic Conference on AI: Methods and Applications of Artificial Intelligence
From Chaotic Iteration to Constraint Propagation
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
An Open-Ended Finite Domain Constraint Solver
PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
SICStus MT - A Multithreaded Execution Environment for SICStus Prolog
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
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
Logic programming in the context of multiparadigm programming: the Oz experience
Theory and Practice of Logic Programming
Refining the basic constraint propagation algorithm
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A new method for solving interval and fuzzy equations: Linear case
Information Sciences: an International Journal
Minimizing the ripple effect of web-centric software by using the pheromone extension
Information Sciences: an International Journal
Hi-index | 0.09 |
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 channel-based communicating processes and TCP/IP communication, that 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. This paper describes the original Csp-ii system along with details of the extensions that resulted to the Cspcons system and presents an example demonstrating the applicability of the system to distributed constraint satisfaction problems.