SUNNY-CP : a Sequential CP Portfolio Solver

Roberto Amadini 1, 2 Maurizio Gabbrielli 2, 1 Jacopo Mauro 2, 1
1 DISI - Department of Computer Science and Engineering [Bologna]
2 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
Abstract : The Constraint Programming (CP) paradigm allows to model and solve Constraint Satisfaction / Optimization Problems (CSPs / COPs). A CP Portfolio Solver is a particular constraint solver that takes advantage of a portfolio of different CP solvers in order to solve a given problem by properly exploiting Algorithm Selection techniques. In this work we present sunny-cp: a CP portfolio for solving both CSPs and COPs that turned out to be competitive also in the MiniZinc Challenge, the reference competition for CP solvers.
Keywords : Categories and Subject Descriptors I2 [Computing Methodologies]: Artificial Intelligence— Constraint Programming Algorithm Portfolios Solvers and Tools
Document type :
Conference papers
Complete list of metadatas

Cited literature [31 references]  Display  Hide  Download
https://hal.inria.fr/hal-01227589
Contributor : Amadini Roberto <>
Submitted on : Monday, November 23, 2015 - 5:28:50 PM
Last modification on : Wednesday, October 10, 2018 - 10:09:14 AM
Long-term archiving on : Wednesday, February 24, 2016 - 10:21:01 AM

File

sac_2015 (1).pdf
Files produced by the author(s)

Identifiers

Collections

INRIA | UNIV-COTEDAZUR

Citation

Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro. SUNNY-CP : a Sequential CP Portfolio Solver. SAC, Apr 2015, Salamanca, Spain. ⟨10.1145/2695664.2695741⟩. ⟨hal-01227589⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

458

Files downloads

224

Contact


archive-ouverte@inria.fr