SUNNY: a Lazy Portfolio Approach for Constraint Solving - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theory and Practice of Logic Programming Year : 2014

SUNNY: a Lazy Portfolio Approach for Constraint Solving

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.
Fichier principal
Vignette du fichier
iclp_2014.pdf (312.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01088489 , version 1 (28-11-2014)

Identifiers

  • HAL Id : hal-01088489 , version 1

Cite

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⟩

Collections

INRIA INRIA2
95 View
136 Download

Share

Gmail Facebook X LinkedIn More