Building constraint satisfaction problem solvers using rewrite rules and strategies
Fundamenta Informaticae - Special issue on foundations of constraint programming
Coordination of heterogeneous distributed cooperative constraint solving
ACM SIGAPP Applied Computing Review - Special issue on coodination languages and models
Implementing non-linear constraints with cooperative solvers
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Revising hull and box consistency
Proceedings of the 1999 international conference on Logic programming
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Control Language for Designing Constraint Solvers
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Combining Local Consistency, Symbolic Rewriting and Interval Methods
AISMC-3 Proceedings of the International Conference AISMC-3 on Artificial Intelligence and Symbolic Mathematical Computation
COLETTE, Prototyping CSP Solvers Using a Rule-Based Language
AISC '98 Proceedings of the International Conference on Artificial Intelligence and Symbolic Computation
A Graphical Interface for Solver Cooperations
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
| Hi-index | 0.00 |
In this paper, we propose a strategy language for designing schemes of constraint solver collaborations: a set of strategy operators enables one to design several kinds of collaborations. We exemplify the use of this language by describing some well known techniques for solving constraints over finite domains and non-linear constraints over real numbers via collaboration of solvers.