Constraint-based analysis of composite solvers

Details Constraint-based analysis of composite solvers Constraint-based analysis of composite solvers

2003-02-25

arxiv.org/abs/cs/0302036v2

Computer Science

Artificial Intelligence

submitted to AI SAC 2004

Scientific paper

Cooperative constraint solving is an area of constraint programming that studies the interaction between constraint solvers with the aim of discovering the interaction patterns that amplify the positive qualities of individual solvers. Automatisation and formalisation of such studies is an important issue of cooperative constraint solving. In this paper we present a constraint-based analysis of composite solvers that integrates reasoning about the individual solvers and the processed data. The idea is to approximate this reasoning by resolution of set constraints on the finite sets representing the predicates that express all the necessary properties. We illustrate application of our analysis to two important cooperation patterns: deterministic choice and loop.

Affiliated with

Also associated with

No associations

Rating

Constraint-based analysis of composite solvers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Constraint-based analysis of composite solvers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constraint-based analysis of composite solvers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-482570