Skip to Main content Skip to Navigation
New interface
Journal articles

SUNNY: a Lazy Portfolio Approach for Constraint Solving

Roberto Amadini 1, 2 Maurizio Gabbrielli 1, 2 Jacopo Mauro 2, 1 
2 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
Abstract : Within the context of constraint solving, a portfolio approach allows one to exploit the synergy between different solvers in order to create a globally better solver. In this paper we present SUNNY: a simple and flexible algorithm that takes advantage of a portfolio of constraint solvers in order to compute — without learning an explicit model — a schedule of them for solving a given Constraint Satisfaction Problem (CSP). Motivated by the performance reached by SUNNY vs. different simulations of other state of the art approaches, we developed sunny-csp, an effective portfolio solver that exploits the underlying SUNNY algorithm in order to solve a given CSP. Empirical tests conducted on exhaustive benchmarks of MiniZinc models show that the actual performance of sunny-csp conforms to the predictions. This is encouraging both for improving the power of CSP portfolio solvers and for trying to export them to fields such as Answer Set Programming and Constraint Logic Programming.
Document type :
Journal articles
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Jacopo Mauro Connect in order to contact the contributor
Submitted on : Friday, November 28, 2014 - 10:10:50 AM
Last modification on : Wednesday, February 2, 2022 - 3:56:16 PM
Long-term archiving on: : Friday, April 14, 2017 - 10:45:47 PM


Files produced by the author(s)


  • HAL Id : hal-01088489, version 1



Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro. SUNNY: a Lazy Portfolio Approach for Constraint Solving. Theory and Practice of Logic Programming, 2014, pp.509-524. ⟨hal-01088489⟩



Record views


Files downloads