TY  - JOUR
A1  - Gebser, Martin
A1  - Maratea, Marco
A1  - Ricca, Francesco
T1  - The Seventh Answer Set Programming Competition
BT  - design and results
JF  - Theory and practice of logic programming
N2  - Answer Set Programming (ASP) is a prominent knowledge representation language with roots in logic programming and non-monotonic reasoning. Biennial ASP competitions are organized in order to furnish challenging benchmark collections and assess the advancement of the state of the art in ASP solving. In this paper, we report on the design and results of the Seventh ASP Competition, jointly organized by the University of Calabria (Italy), the University of Genova (Italy), and the University of Potsdam (Germany), in affiliation with the 14th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR 2017).
KW  - Answer Set Programming
KW  - competition
Y1  - 2019
U6  - https://doi.org/10.1017/S1471068419000061
SN  - 1471-0684
SN  - 1475-3081
VL  - 20
IS  - 2
SP  - 176
EP  - 204
PB  - Cambridge Univ. Press
CY  - Cambridge [u.a.]
ER  - 
TY  - JOUR
A1  - Cabalar, Pedro
A1  - Fandiño, Jorge
A1  - Lierler, Yuliya
T1  - Modular Answer Set Programming as a formal specification language
JF  - Theory and practice of logic programming
N2  - In this paper, we study the problem of formal verification for Answer Set Programming (ASP), namely, obtaining aformal proofshowing that the answer sets of a given (non-ground) logic programPcorrectly correspond to the solutions to the problem encoded byP, regardless of the problem instance. To this aim, we use a formal specification language based on ASP modules, so that each module can be proved to capture some informal aspect of the problem in an isolated way. This specification language relies on a novel definition of (possibly nested, first order)program modulesthat may incorporate local hidden atoms at different levels. Then,verifyingthe logic programPamounts to prove some kind of equivalence betweenPand its modular specification.
KW  - Answer Set Programming
KW  - formal specification
KW  - formal verification
KW  - modular logic programs
Y1  - 2020
U6  - https://doi.org/10.1017/S1471068420000265
SN  - 1471-0684
SN  - 1475-3081
VL  - 20
IS  - 5
SP  - 767
EP  - 782
PB  - Cambridge University Press
CY  - New York
ER  - 
TY  - JOUR
A1  - Cabalar, Pedro
A1  - Fandiño, Jorge
A1  - Garea, Javier
A1  - Romero, Javier
A1  - Schaub, Torsten H.
T1  - Eclingo
BT  - a solver for epistemic logic programs
JF  - Theory and practice of logic programming
N2  - We describe eclingo, a solver for epistemic logic programs under Gelfond 1991 semantics built upon the Answer Set Programming system clingo. The input language of eclingo uses the syntax extension capabilities of clingo to define subjective literals that, as usual in epistemic logic programs, allow for checking the truth of a regular literal in all or in some of the answer sets of a program. The eclingo solving process follows a guess and check strategy. It first generates potential truth values for subjective literals and, in a second step, it checks the obtained result with respect to the cautious and brave consequences of the program. This process is implemented using the multi-shot functionalities of clingo. We have also implemented some optimisations, aiming at reducing the search space and, therefore, increasing eclingo 's efficiency in some scenarios. Finally, we compare the efficiency of eclingo with two state-of-the-art solvers for epistemic logic programs on a pair of benchmark scenarios and show that eclingo generally outperforms their obtained results.
KW  - Answer Set Programming
KW  - Epistemic Logic Programs
KW  - Non-Monotonic
KW  - Reasoning
KW  - Conformant Planning
Y1  - 2020
U6  - https://doi.org/10.1017/S1471068420000228
SN  - 1471-0684
SN  - 1475-3081
VL  - 20
IS  - 6
SP  - 834
EP  - 847
PB  - Cambridge Univ. Press
CY  - New York
ER  -