Arc and path consistence revisited
Artificial Intelligence
Solving Polynomial Systems Using a Branch and Prune Approach
SIAM Journal on Numerical Analysis
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
The essence of constraint propagation
Theoretical Computer Science
Implementing non-linear constraints with cooperative solvers
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Basic Operators for Solving Constraints via Collaboration of Solvers
AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
| Hi-index | 0.00 |
We propose a strategy language for designing single constraint solvers as well as their collaborations. Based on the notions of constraint filter, separator, and sorter, we define basic strategy operators that allow us to specify single solvers and their collaboration in a uniform way. We exemplify the use of this language by specifying some techniques for solving non-linear constraints over real numbers and CSPs over finite domains.