Automatic analysis of composite solvers

Abstract

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.