A Portfolio Solver for Answer Set Programming: Preliminary Report

Gebser, Martin; Kaminski, Roland; Kaufmann, Benjamin; Schaub, Torsten; Schneider, Marius; Ziller, Stefan

doi:10.1007/978-3-642-20895-9_40

Cited by 62 publications

(47 citation statements)

References 18 publications

(25 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Portfolio solvers have been successful in combinatorially cleaner domains such as SAT solving [27,35,42], quantified boolean satisfiability (QSAT) [32,33,36], answer set programming (ASP) [20,29], and various constraint satisfaction problems (CSP) [21,28,30]. In contrast to software verification, in these areas constituent tools are usually assumed to be correct.…”

Section: Related Workmentioning

confidence: 99%

Empirical software metrics for benchmarking of verification tools

Demyanova

Pani

Veith

et al. 2017

Form Methods Syst Des

View full text Add to dashboard Cite

We study empirical metrics for software source code, which can predict the performance of verification tools on specific types of software. Our metrics comprise variable usage patterns, loop patterns, as well as indicators of control-flow complexity and are extracted by simple data-flow analyses. We demonstrate that our metrics are powerful enough to devise a machine-learning based portfolio solver for software verification. We show that this portfolio solver would be the (hypothetical) overall winner of the international competition on software verification (SV-COMP) in three consecutive years (2014)(2015)(2016). This gives strong empirical evidence for the predictive power of our metrics and demonstrates the viability of portfolio solvers for software verification. Moreover, we demonstrate the flexibility of our algorithm for portfolio construction in novel settings: originally conceived for SV-COMP'14, the construction works just as well for SV-COMP'15 (considerably more verification tasks) and for SV-COMP'16 (considerably more candidate verification tools).

show abstract

Section: Related Workmentioning

confidence: 99%

Empirical software metrics for benchmarking of verification tools

Demyanova

Pani

Veith

et al. 2017

Form Methods Syst Des

View full text Add to dashboard Cite

show abstract

“…Several authors have since used the term for describing any strategy that combines multiple algorithms, considered as black-boxes, to solve a single problem instance. Examples of portfolio approaches in Artificial Intelligence can be found, for instance, in SAT, ASP, CSP and QBF [62,14,44].…”

Section: Algorithm Portfoliosmentioning

confidence: 99%

“…These observations motivate the idea of configuring and exploiting a portfolio of planners to achieve better overall performance than any individual planner. Moreover, portfoliobased approaches have been successfully applied to a number of combinatorial search domains, such as SAT [62], maxSAT [36], Answer Set Programming (ASP) [14], and QBF [43].…”

Section: Introductionmentioning

confidence: 99%

Portfolio-based planning: State of the art, common practice and open challenges

Vallati

Chrpa

Kitchin

2015

AIC

View full text Add to dashboard Cite

In recent years the field of automated planning has significantly advanced and several powerful domain-independent planners have been developed. However, none of these systems clearly outperforms all the others in every known benchmark domain. This observation motivated the idea of configuring and exploiting a portfolio of planners to perform better than any individual planner: some recent planning systems based on this idea achieved significantly good results in experimental analysis and International Planning Competitions. Such results let us suppose that future challenges of the Automated Planning community will converge on designing different approaches for combining existing planning algorithms. This paper reviews existing techniques and provides an exhaustive guide to portfolio-based planning. In addition, the paper outlines open issues of existing approaches and highlights possible future evolution of these techniques.

show abstract

“…Surprisingly, despite their proven effectiveness, portfolio solvers are rarely used in practice and usually restricted to the SAT field. Outside the SAT world there are indeed only few applications of portfolios: for example, Gebser et al (2011) for ASP, OMahony et al (2009) for CSP, and Hutter et al (2012) for optimization problems like the Traveling Salesman Problem. On the other hand, if we exclude competitive scenarios such as the SAT Competitions, even the SAT portfolio solvers are actually underutilized.…”

Section: Introductionmentioning

confidence: 99%

“…Our goal is, on one hand, bridging the gap between SAT and CSP portfolio solvers, and, on the other hand, encouraging the dissemination and the utilization in practice of portfolio solvers even in other growing fields such as, for example, the Answer-Set Programming and Constraint Logic Programming paradigms where a few portfolio approaches have been studied (see for example Gebser et al (2011)). As a first step in this direction, in this paper we present SUNNY and sunny-csp.…”

Section: Introductionmentioning

confidence: 99%

SUNNY: a Lazy Portfolio Approach for Constraint Solving

Amadini

Gabbrielli

Mauro

2014

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

Abstract*** To appear in Theory and Practice of Logic Programming (TPLP) *** 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 computewithout 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.

show abstract

A Portfolio Solver for Answer Set Programming: Preliminary Report

Cited by 62 publications

References 18 publications

Empirical software metrics for benchmarking of verification tools

Empirical software metrics for benchmarking of verification tools

Portfolio-based planning: State of the art, common practice and open challenges

SUNNY: a Lazy Portfolio Approach for Constraint Solving

Contact Info

Product

Resources

About