Constraint-based analysis of composite solvers
| dc.creator | Petrov, Evgueni | |
| dc.creator | Monfroy, Eric | |
| dc.date | 2003-02-25 | |
| dc.date | 2003-09-07 | |
| dc.date.accessioned | 2026-07-07T03:19:29Z | |
| dc.date.available | 2026-07-07T03:19:29Z | |
| dc.description | 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. | |
| dc.description | submitted to AI SAC 2004 | |
| dc.identifier | https://arxiv.org/abs/cs/0302036 | |
| dc.identifier | http://arxiv.org/abs/cs/0302036 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31479 | |
| dc.subject | Artificial Intelligence | |
| dc.subject | I.2 | |
| dc.title | Constraint-based analysis of composite solvers | |
| dc.type | text |