The Seventh Answer Set Programming Competition: Design and Results

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). (Under consideration for acceptance in TPLP).

[1]  Simona Perri,et al.  I-DLV: The new intelligent grounder of DLV , 2017, Intelligenza Artificiale.

[2]  Martin Gebser,et al.  Improving the Normalization of Weight Rules in Answer Set Programs , 2014, JELIA.

[3]  Shahab Tasharrofi,et al.  Stable-unstable semantics: Beyond NP with normal logic programs , 2016, Theory Pract. Log. Program..

[4]  Thomas Eiter,et al.  Answer Set Programming: A Primer , 2009, Reasoning Web.

[5]  Martin Gebser,et al.  The Design of the Seventh Answer Set Programming Competition , 2017, LPNMR.

[6]  Martin Gebser,et al.  Evaluation Techniques and Systems for Answer Set Programming: a Survey , 2018, IJCAI.

[7]  Michael Gelfond,et al.  Integrating answer set programming and constraint logic programming , 2008, Annals of Mathematics and Artificial Intelligence.

[8]  Igor Stéphan,et al.  ASPeRiX, a first-order forward chaining approach for answer set computing , 2017, Theory Pract. Log. Program..

[9]  Martin Gebser,et al.  Design and results of the Fifth Answer Set Programming Competition , 2016, Artif. Intell..

[10]  Martin Gebser,et al.  Engineering an Incremental ASP Solver , 2008, ICLP.

[11]  Martin Gebser,et al.  The Design of the Sixth Answer Set Programming Competition - - Report - , 2014, LPNMR.

[12]  Simona Perri,et al.  I-DLV+MS: Preliminary Report on an Automatic ASP Solver Selector , 2017, RCRA@AI*IA.

[13]  Thomas Eiter,et al.  Semi-equilibrium models for paracoherent answer set programs , 2016, Artif. Intell..

[14]  Miroslaw Truszczynski,et al.  Generating Hard Random Boolean Formulas and Disjunctive Logic Programs , 2017, IJCAI.

[15]  Michel Van Caneghem,et al.  Solving Crew Scheduling Problems bu Constraint Programming , 1995, CP.

[16]  Mario Alviano,et al.  The ASP System DLV2 , 2017, LPNMR.

[17]  Jan Mendling,et al.  Resource Allocation with Dependencies in Business Process Management Systems , 2016, BPM.

[18]  Ilkka Niemelä,et al.  Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses , 2011, Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning.

[19]  Vladimir Lifschitz,et al.  Twelve Definitions of a Stable Model , 2008, ICLP.

[20]  Martin Gebser,et al.  Rewriting Optimization Statements in Answer-Set Programs , 2016, ICLP.

[21]  Chitta Baral,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

[22]  Gopal Gupta,et al.  Dynamic Consistency Checking in Goal-Directed Answer Set Programming , 2014, Theory and Practice of Logic Programming.

[23]  Luca Pulina,et al.  A multi-engine approach to answer-set programming* , 2013, Theory and Practice of Logic Programming.

[24]  Rina Dechter,et al.  Propositional semantics for disjunctive logic programs , 1994, Annals of Mathematics and Artificial Intelligence.

[25]  Marius Thomas Lindauer,et al.  A Portfolio Solver for Answer Set Programming: Preliminary Report , 2011, LPNMR.

[26]  Victor W. Marek,et al.  Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

[27]  Simona Perri,et al.  Efficiently Coupling the I-DLV Grounder with ASP Solvers , 2018, Theory and Practice of Logic Programming.

[28]  Michael Gelfond,et al.  Logic programming and knowledge representation—The A-Prolog perspective , 2002 .

[29]  Wolfgang Faber,et al.  Externally Supported Models for Efficient Computation of Paracoherent Answer Sets , 2018, AAAI.

[30]  Martin Gebser,et al.  What's Hot in the Answer Set Programming Competition , 2016, AAAI.

[31]  Tomi Janhunen,et al.  Optimizing phylogenetic supertrees using answer set programming , 2015, Theory and Practice of Logic Programming.

[32]  Luca Pulina,et al.  Automated Selection of Grounding Algorithm in Answer Set Programming , 2013, AI*IA.

[33]  Luca Pulina,et al.  The Multi-Engine ASP Solver me-asp , 2012, JELIA.

[34]  Maurice Bruynooghe,et al.  Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3 , 2013, Theory and Practice of Logic Programming.

[35]  Martin Gebser,et al.  Answer Set Programming as SAT modulo Acyclicity , 2014, ECAI.

[36]  Martin Gebser,et al.  Answer Set Programming Modulo Acyclicity , 2015, Fundam. Informaticae.

[37]  Mario Alviano,et al.  Advances in WASP , 2015, LPNMR.

[38]  Simona Perri,et al.  Optimizing Answer Set Computation via Heuristic-Based Decomposition , 2018, Theory and Practice of Logic Programming.

[39]  Maratea Marco,et al.  The Design of the Seventh Answer Set Programming Competition , 2017 .

[40]  Martin Gebser,et al.  Progress in clasp Series 3 , 2015, LPNMR.

[41]  Luca Pulina,et al.  Multi-level Algorithm Selection for ASP , 2015, LPNMR.

[42]  Georg Gottlob,et al.  On the computational cost of disjunctive logic programming: Propositional case , 1995, Annals of Mathematics and Artificial Intelligence.

[43]  Ilkka Niemelä,et al.  Logic programs with stable model semantics as a constraint programming paradigm , 1999, Annals of Mathematics and Artificial Intelligence.

[44]  James Cussens,et al.  Bayesian network learning with cutting planes , 2011, UAI.

[45]  Wolfgang Faber,et al.  On the Computation of Paracoherent Answer Sets , 2017, AAAI.

[46]  Wolfgang Faber,et al.  Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers , 2008, J. Algorithms.

[47]  Martin Gebser,et al.  The Sixth Answer Set Programming Competition , 2017, J. Artif. Intell. Res..

[48]  Miroslaw Truszczynski,et al.  Answer set programming at a glance , 2011, Commun. ACM.

[49]  Chiaki Sakama,et al.  A Fixpoint Characterization of Abductive Logic Programs , 1996, J. Log. Program..

[50]  François Fages,et al.  Consistency of Clark's completion and existence of stable models , 1992, Methods Log. Comput. Sci..

[51]  Ilkka Niemelä,et al.  Answer Set Programming via Mixed Integer Programming , 2012, KR.

[52]  Martin Gebser,et al.  Learning discrete decomposable graphical models via constraint optimization , 2017, Stat. Comput..

[53]  Michael Gelfond,et al.  Knowledge Representation and Logic Programming , 2002, Artif. Intell..

[54]  Daniele Magazzeni,et al.  CASP solutions for planning in hybrid domains , 2017, Theory Pract. Log. Program..

[55]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[56]  Vladimir Lifschitz,et al.  Answer set programming and plan generation , 2002, Artif. Intell..

[57]  Wolfgang Faber,et al.  The DLV system for knowledge representation and reasoning , 2002, TOCL.

[58]  Yuliya Lierler,et al.  Systems, Engineering Environments, and Competitions , 2016, AI Mag..

[59]  Giovambattista Ianni,et al.  The third open answer set programming competition , 2012, Theory and Practice of Logic Programming.