Constraint-based Analysis of Composite Solvers

E. Petrov and E. Monfroy (France)


AI in software engineering, set constraints


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 posi tive qualities of individual constraint solvers. Analysis of composite solvers is a theoretically and practically important issue in cooperative constraint solv ing. In this paper, we present an analysis by means of set constraints which allows one to reason about the be haviour of composite solvers in terms of pre- and post conditions.

Important Links:

Go Back