Basic components for constraint solver cooperations
Proceedings of the 2003 ACM symposium on Applied computing
Towards automated reasoning on the properties of numerical constraints
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
| Hi-index | 0.00 |
Cooperative constraint solving is an area of constraint programming which develops and studies methods for organizing interaction between constraint solvers. The goal of research in cooperative constraint solving is to discover the interaction patterns which amplify the positive qualities of individual constraint solvers.Analysis of composite solvers is a theoretically and practically important issue in cooperative constraint solving. In this paper, we present an analysis by means of set constraints which allows one to reason about the behaviour of composite solvers in terms of pre- and post-conditions.