Advances in WASP

Alviano, Mario; Dodaro, Carmine; Leone, Nicola; Ricca, Francesco

doi:10.1007/978-3-319-23264-5_5

Cited by 90 publications

(82 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In fact, ME-ASP, WASP+DLV, and WASP completed more runs on Optimization problems than LP2NORMAL+CLASP, which still achieved the highest scores, as given in Figure 3(a). This divergence is due to the use of different optimization strategies, namely model-versus core-guided approaches (Morgado, Heras, Liffiton, Planes, & Marques-Silva, 2013;Alviano et al, 2015a;Alviano, Dodaro, Marques-Silva, & Ricca, 2015b;, where the former are geared for producing good-quality solutions and the latter for confirming optimum solutions. 3 As ME-ASP, WASP+DLV, and WASP utilize core-guided optimization, they are able to complete more runs than LP2NORMAL+CLASP, whose model-guided approach yields better solutions in case of timeouts.…”

Section: Results In the Sp Categorymentioning

confidence: 99%

“…Going beyond DPLL-based solvers (and their extensions), the second generation of native ASP solvers, including CLASP and WASP (Alviano, Dodaro, Leone, & Ricca, 2015a), integrates CDCL-style search with propagation principles dedicated to ASP programs. Implementation features shared with modern SAT solvers include, e.g., watched literals (Moskewicz, Madigan, Zhao, Zhang, & Malik, 2001), activity-based heuristics (Biere & Fröhlich, 2015), and rapid restarts (Huang, 2007).…”

Section: Native Approachesmentioning

confidence: 99%

See 1 more Smart Citation

The Sixth Answer Set Programming Competition

Gebser¹,

Maratea²,

Ricca³

2017

jair

Self Cite

View full text Add to dashboard Cite

Answer Set Programming (ASP) is a well-known paradigm of declarative programming with roots in logic programming and non-monotonic reasoning. Similar to other closely related problemsolving technologies, such as SAT/SMT, QBF, Planning and Scheduling, advancements in ASP solving are assessed in competition events. In this paper, we report about the design and results of the Sixth ASP Competition, which was jointly organized by the University of Calabria (Italy), Aalto University (Finland), and the University of Genoa (Italy), in affiliation with the 13th International Conference on Logic Programming and Non-Monotonic Reasoning. This edition maintained some of the design decisions introduced in 2014, e.g., the conception of sub-tracks, the scoring scheme, and the adherence to a fixed modeling language in order to push the adoption of the ASP-Core-2 standard. On the other hand, it featured also some novelties, like a benchmark selection stage classifying instances according to their empirical hardness, and a "Marathon" track where the topperforming systems are given more time for solving hard benchmarks.

show abstract

Section: Results In the Sp Categorymentioning

confidence: 99%

Section: Native Approachesmentioning

confidence: 99%

The Sixth Answer Set Programming Competition

Gebser¹,

Maratea²,

Ricca³

2017

jair

Self Cite

View full text Add to dashboard Cite

show abstract

“…w > p > 0 and p > w > 0 corresponding to formulations 1. and 2. of CPAP, respectively. We executed the ASP solvers CLASP [24] and WASP [1]. The former has been configured with the model-guided algorithm called bb [24], which basically searches for an answer set so to initialize an upper bound of the optimum cost, and new answer sets of improved cost are iteratively searched until the optimum cost is found.…”

Section: Methodsmentioning

confidence: 99%

On the Application of Answer Set Programming to the Conference Paper Assignment Problem

Amendola

Dodaro

Leone

et al. 2016

AI*IA 2016 Advances in Artificial Intelligence

Self Cite

View full text Add to dashboard Cite

Abstract. Among the tasks to be carried out by conference organizers is the one of assigning reviewers to papers. That problem is known in the literature as the Conference Paper Assignment Problem (CPAP). In this paper we approach the solution of a reasonably rich variant of the CPAP by means of Answer Set Programming (ASP). ASP is an established logic-based programming paradigm which has been successfully applied for solving complex problems arising in Artificial Intelligence. We show how the CPAP can be elegantly encoded by means of an ASP program, and we analyze the results of an experiment, conducted on real-world data, that outlines the viability of our solution.

show abstract

“…Although (flat) ABA and (normal) logic programming are technically equivalent, there is an important conceptual difference between them. Logic programming over the years has evolved mostly into a formalism for "constraint satisfaction", by expanding the (2-valued) stable model semantics for normal logic programs to answer sets for logic programs with strong negation, disjunction, and other constructs (so-called answer set programs), as evidenced by the current popularity of answer set programming (e.g., Brewka, Eiter, & Truszczynski, 2011;Calimeri, Ianni, Krennwallner, & Ricca, 2012;Calimeri, Gebser, Maratea, & Ricca, 2016;Gebser, Kaufmann, Kaminski, Ostrowski, Schaub, & Schneider, 2011;Alviano, Dodaro, Leone, & Ricca, 2015;Leone, Pfeifer, Faber, Eiter, Gottlob, Perri, & Scarcello, 2006;Liu, Janhunen, & Niemelä, 2012;Lin & Zhao, 2004). The idea is for a particular problem (say, a sudoku puzzle) to be represented as an answer set program, so that the resulting answer sets correspond to the solutions of the original problem.…”

Section: Discussionmentioning

confidence: 99%

On the Equivalence between Assumption-Based Argumentation and Logic Programming

Caminada

Schulz

2017

jair

View full text Add to dashboard Cite

Assumption-Based Argumentation (ABA) has been shown to subsume various other non-monotonic reasoning formalisms, among them normal logic programming (LP). We re-examine the relationship between ABA and LP and show that normal LP also subsumes (flat) ABA. More precisely, we specify a procedure that given a (flat) ABA framework yields an associated logic program with almost the same syntax whose semantics coincide with those of the ABA framework. That is, the 3-valued stable (respectively well-founded, regular, 2-valued stable, and ideal) models of the associated logic program coincide with the complete (respectively grounded, preferred, stable, and ideal) assumption labellings and extensions of the ABA framework. Moreover, we show how our results on the translation from ABA to LP can be reapplied for a reverse translation from LP to ABA, and observe that some of the existing results in the literature are in fact special cases of our work. Overall, we show that (flat) ABA frameworks can be seen as normal logic programs with a slightly different syntax. This implies that methods developed for one of these formalisms can be equivalently applied to the other by simply modifying the syntax.

show abstract

Advances in WASP

Cited by 90 publications

References 24 publications

The Sixth Answer Set Programming Competition

The Sixth Answer Set Programming Competition

On the Application of Answer Set Programming to the Conference Paper Assignment Problem

On the Equivalence between Assumption-Based Argumentation and Logic Programming

Contact Info

Product

Resources

About