SUNNY: a Lazy Portfolio Approach for Constraint Solving

DOI10.1017/S1471068414000179zbMath1307.68077arXiv1311.3353WikidataQ62043689 ScholiaQ62043689MaRDI QIDQ2931261

Roberto Amadini, Jacopo Mauro, Maurizio Gabbrielli

Publication date: 25 November 2014

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.3353

zbMATH Keywords

artificial intelligenceconstraint satisfactionmachine learningalgorithms portfolio

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (13)

Portfolio approaches for constraint optimization problems ⋮ ASlib: a benchmark library for algorithm selection ⋮ Portfolio theorem proving and prover runtime prediction for geometry ⋮ A constraint-based local search backend for MiniZinc ⋮ Parallel Logic Programming: A Sequel ⋮ Algorithm selection on a meta level ⋮ SUNNY-CP and the MiniZinc challenge ⋮ Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges ⋮ On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem ⋮ Extreme Cases in SAT Problems ⋮ SUNNY ⋮ The algorithm selection competitions 2015 and 2017 ⋮ Wombit: a portfolio bit-vector solver using word-level propagation

Uses Software

• MiniZinc
• SATzilla
• aspeed

Cites Work

• A survey of cross-validation procedures for model selection
• A self-adaptive multi-engine solver for quantified Boolean formulas
• Consistency in networks of relations
• Algorithm portfolios

This page was built for publication: SUNNY: a Lazy Portfolio Approach for Constraint Solving