A Multicore Tool for Constraint Solving

02/13/2015
by   Roberto Amadini, et al.
0

*** To appear in IJCAI 2015 proceedings *** In Constraint Programming (CP), a portfolio solver uses a variety of different solvers for solving a given Constraint Satisfaction / Optimization Problem. In this paper we introduce sunny-cp2: the first parallel CP portfolio solver that enables a dynamic, cooperative, and simultaneous execution of its solvers in a multicore setting. It incorporates state-of-the-art solvers, providing also a usable and configurable framework. Empirical results are very promising. sunny-cp2 can even outperform the performance of the oracle solver which always selects the best solver of the portfolio for a given problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/26/2017

SUNNY-CP and the MiniZinc Challenge

In Constraint Programming (CP) a portfolio solver combines a variety of ...
research
08/01/2013

An Enhanced Features Extractor for a Portfolio of Constraint Solvers

Recent research has shown that a single arbitrarily efficient solver can...
research
12/21/2018

Solution Dominance over Constraint Satisfaction Problems

Constraint Satisfaction Problems (CSPs) typically have many solutions th...
research
08/10/2021

Parallel Computation of Combinatorial Symmetries

In practice symmetries of combinatorial structures are computed by trans...
research
03/24/2020

Hybrid Classification and Reasoning for Image-based Constraint Solving

There is an increased interest in solving complex constrained problems w...
research
05/08/2013

Unsatisfiable Cores for Constraint Programming

Constraint Programming (CP) solvers typically tackle optimization proble...
research
11/04/2021

Predictive Machine Learning of Objective Boundaries for Solving COPs

Solving Constraint Optimization Problems (COPs) can be dramatically simp...

Please sign up or login with your details

Forgot password? Click here to reset