aspeed: Solver scheduling via answer set programming

DOI10.1017/S1471068414000015zbMath1379.68283arXiv1401.1024OpenAlexW2170245713WikidataQ59585916 ScholiaQ59585916MaRDI QIDQ4592974

Holger H. Hoos, Marius Lindauer, Roland Kaminski, Torsten Schaub

Publication date: 9 November 2017

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

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

zbMATH Keywords

answer set programmingalgorithm schedulesportfolio-based solving

Mathematics Subject Classification ID

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

Related Items (7)

Multi-level Algorithm Selection for ASP ⋮ A review of literature on parallel constraint solving ⋮ Parallel Logic Programming: A Sequel ⋮ Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges ⋮ Selecting algorithms for large berth allocation problems ⋮ aspeed ⋮ The algorithm selection competitions 2015 and 2017

Uses Software

• Paramils
• SATzilla
• Potassco
• irace
• Sugar
• SMAC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Principles and practice of constraint programming. 18th international conference, CP 2012, Québec City, QC, Canada, October 8--12, 2012. Proceedings
• Compiling finite linear CSP into SAT
• Learning dynamic algorithm portfolios
• A self-adaptive multi-engine solver for quantified Boolean formulas
• Conflict-driven answer set solving: from theory to practice
• Hierarchical Hardness Models for SAT
• ParamILS: An Automatic Algorithm Configuration Framework
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Unsatisfiability-based optimization in clasp
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Algorithm portfolios

This page was built for publication: aspeed: Solver scheduling via answer set programming