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  - Gebser, Martin
A1  - Maratea, Marco
A1  - Ricca, Francesco
T1  - The sixth answer set programming competition
JF  - Journal of artificial intelligence research : JAIR
N2  - 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.
Y1  - 2017
U6  - https://doi.org/10.1613/jair.5373
SN  - 1076-9757
SN  - 1943-5037
VL  - 60
SP  - 41
EP  - 95
PB  - AI Access Found.
CY  - Marina del Rey
ER  - 
TY  - JOUR
A1  - Brain, Martin
A1  - Faber, Wolfgang
A1  - Maratea, Marco
A1  - Polleres, Axel
A1  - Schaub, Torsten H.
A1  - Schindlauer, Roman
T1  - What should an ASP solver output? : a multiple position paper
Y1  - 2007
ER  -