SUNNY-CP and the MiniZinc Challenge

06/26/2017
by   Roberto Amadini, et al.
0

In Constraint Programming (CP) a portfolio solver combines a variety of different constraint solvers for solving a given problem. This fairly recent approach enables to significantly boost the performance of single solvers, especially when multicore architectures are exploited. In this work we give a brief overview of the portfolio solver sunny-cp, and we discuss its performance in the MiniZinc Challenge---the annual international competition for CP solvers---where it won two gold medals in 2015 and 2016. Under consideration in Theory and Practice of Logic Programming (TPLP)

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/13/2015

A Multicore Tool for Constraint Solving

*** To appear in IJCAI 2015 proceedings *** In Constraint Programming (C...
research
04/28/2017

Kiwi - A Minimalist CP Solver

Kiwi is a minimalist and extendable Constraint Programming (CP) solver s...
research
09/07/2020

sunny-as2: Enhancing SUNNY for Algorithm Selection

SUNNY is an Algorithm Selection (AS) technique originally tailored for C...
research
03/19/2021

Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares

In this paper we provide results on using integer programming (IP) and c...
research
11/09/2018

Stratified Constructive Disjunction and Negation in Constraint Programming

Constraint Programming (CP) is a powerful declarative programming paradi...
research
02/06/2014

Combining finite and continuous solvers

Combining efficiency with reliability within CP systems is one of the ma...
research
08/03/2023

Holy Grail 2.0: From Natural Language to Constraint Models

Twenty-seven years ago, E. Freuder highlighted that "Constraint programm...

Please sign up or login with your details

Forgot password? Click here to reset