POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Concurrent constraint programming
Concurrent constraint programming
Combination of constraint solvers for free and quasi-free structures
Theoretical Computer Science - Special issue: rewriting systems and applications
Programming languages for distributed applications
New Generation Computing
The essence of constraint propagation
Theoretical Computer Science
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
Distributed Constraint Satisfaction with Cooperating Asynchronous Solvers
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
We give a short introduction to Asynchronous Constraint Solving (ACS), which is a new execution model to solve constraint satisfaction problems through constraint propagation and search. Propagation is based on the theory of chaotic iteration and search is implemented with explicit constraint retraction. ACS is designed for the object-oriented development of distributed or strongly interactive applications. Our implementation J.CP makes use of this new execution model. J.CP is a Java package, which combines the declarativity of constraint programming with the features of the object-oriented programming language Java. Constraints are autonomous objects that can be posted and retracted in concurrently running solvers that communicate via common constraint variables.