Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Artificial Intelligence

arXiv:cs/0302036 (cs)
[Submitted on 25 Feb 2003 (v1), last revised 7 Sep 2003 (this version, v2)]

Title:Constraint-based analysis of composite solvers

Authors:Evgueni Petrov, Eric Monfroy
View PDF
Abstract: 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.
Comments: submitted to AI SAC 2004
Subjects: Artificial Intelligence (cs.AI)
ACM classes: I.2
Cite as: arXiv:cs/0302036 [cs.AI]
  (or arXiv:cs/0302036v2 [cs.AI] for this version)
  https://doi.org/10.48550/arXiv.cs/0302036

Submission history

From: Evgueni Petrov [view email]
[v1] Tue, 25 Feb 2003 14:33:08 UTC (26 KB)
[v2] Sun, 7 Sep 2003 23:03:03 UTC (10 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.AI
< prev   |   next >
new | recent | 2003-02

References & Citations

DBLP - CS Bibliography

listing | bibtex
Evgueni Petrov
Eric Monfroy
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)