The Design of the Sixth Answer Set Programming Competition - - Report -

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 problem-solving technologies, such as SAT/SMT, QBF, Planning and Scheduling, advances in ASP solving are assessed in competition events. In this paper, we report about the design of the Sixth ASP Competition, which is jointly organized by the University of Calabria (Italy), Aalto University (Finland), and the University of Genova (Italy), in affiliation with the 13th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR 2015). This edition maintains some of the design decisions introduced in the last event, e.g., the design of tracks, the scoring scheme, and the adherence to a fixed modeling language in order to push the adoption of the Open image in new window standard. On the other hand, it features also some novelties, like a benchmarks selection stage to classify instances according to their expected hardness, and a “marathon” track where the best performing systems are given more time for solving hard benchmarks.

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

[2]  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.

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

[4]  Wolfgang Faber,et al.  Declarative problem-solving using the DLV system , 2000 .

[5]  Mario Alviano,et al.  Preliminary Report on WASP 2.0 , 2014, ArXiv.

[6]  Chitta Baral,et al.  Logic Programming and Knowledge Representation , 1994, J. Log. Program..

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

[8]  Martin Gebser,et al.  Detecting Inconsistencies in Large Biological Networks with Answer Set Programming , 2008, ICLP.

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

[10]  Mikolás Janota,et al.  On Deciding MUS Membership with QBF , 2011, CP.

[11]  Martin D. F. Wong,et al.  Rectilinear Steiner Tree Construction Using Answer Set Programming , 2004, ICLP.

[12]  Martin Gebser,et al.  Multi-threaded ASP solving with clasp , 2012, Theory and Practice of Logic Programming.

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

[14]  Mario Alviano,et al.  The Fourth Answer Set Programming Competition: Preliminary Report , 2013, LPNMR.

[15]  Martin Gebser,et al.  SAT Modulo Graphs: Acyclicity , 2014, JELIA.

[16]  Marco Gavanelli,et al.  An ASP Approach for the Valves Positioning Optimization in a Water Distribution System , 2015, CILC.

[17]  Timo Soininen,et al.  Extending and implementing the stable model semantics , 2000, Artif. Intell..

[18]  Martin Gebser,et al.  Answer Set Programming Modulo Acyclicity , 2016, Fundam. Informaticae.

[19]  Yuliya Lierler,et al.  Answer Set Programming Based on Propositional Satisfiability , 2006, Journal of Automated Reasoning.

[20]  Mario Alviano,et al.  Anytime Computation of Cautious Consequences in Answer Set Programming , 2014, Theory and Practice of Logic Programming.

[21]  Martin Gebser,et al.  Repair and Prediction (under Inconsistency) in Large Biological Networks with Answer Set Programming , 2010, KR.

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

[23]  Ilkka Niemelä,et al.  Translating Answer-Set Programs into Bit-Vector Logic , 2011, INAP/WLP.

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

[25]  Marcello Balduccini,et al.  Industrial-Size Scheduling with ASP+CP , 2011, LPNMR.

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

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

[28]  Mario Alviano,et al.  WASP: A Native ASP Solver Based on Constraint Learning , 2013, LPNMR.

[29]  Gerald Pfeifer,et al.  Design and implementation of aggregate functions in the DLV system* , 2008, Theory and Practice of Logic Programming.

[30]  Simona Perri,et al.  I -dlv: The New Intelligent Grounder of dlv , 2016, AI*IA.

[31]  Daniel Le Berre,et al.  The Sat4j library, release 2.2 , 2010, J. Satisf. Boolean Model. Comput..

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

[33]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

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

[35]  Alessandro Dal Palù,et al.  GASP: Answer Set Programming with Lazy Grounding , 2009, Fundam. Informaticae.

[36]  Martin Gebser,et al.  Conflict-driven answer set solving: From theory to practice , 2012, Artif. Intell..

[37]  Jori Bomanson,et al.  Normalizing Cardinality Rules Using Merging and Sorting Constructions , 2013, LPNMR.

[38]  Martin Gebser,et al.  Combining Heuristics for Configuration Problems Using Answer Set Programming , 2015, LPNMR.

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

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

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

[42]  Esra Erdem,et al.  Tight logic programs , 2003, Theory and Practice of Logic Programming.

[43]  V. S. Costa,et al.  Theory and Practice of Logic Programming , 2010 .

[44]  Daniele Magazzeni,et al.  PDDL+ Planning via Constraint Answer Set Programming , 2016, ICLP 2016.

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

[46]  Martin Gebser,et al.  Grounding Recursive Aggregates: Preliminary Report , 2016, ArXiv.

[47]  Vladimir Lifschitz,et al.  Answer Set Planning (Abstract) , 1999, LPNMR.

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

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

[50]  Georg Gottlob,et al.  Optimization Methods for the Partner Units Problem , 2011, CPAIOR.

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

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

[53]  Christian Haubelt,et al.  A symbolic system synthesis approach for hard real-time systems based on coordinated SMT-solving , 2015, 2015 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[54]  Martin Gebser,et al.  Advanced Conflict-Driven Disjunctive Answer Set Solving , 2013, IJCAI.

[55]  Mario Alviano,et al.  A MaxSAT Algorithm Using Cardinality Constraints of Bounded Size , 2015, IJCAI.

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

[57]  Alberto Blanc,et al.  Optimal set of video representations in adaptive streaming , 2014, MMSys '14.

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

[59]  Georg Gottlob,et al.  Disjunctive datalog , 1997, TODS.

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

[61]  Martin Gebser,et al.  The Design of the Fifth Answer Set Programming Competition , 2014, ArXiv.

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

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

[64]  Mario Alviano,et al.  JWASP: A New Java-Based ASP Solver , 2015, RCRA@AI*IA.

[65]  Peter J. Stuckey,et al.  Optimal k-Level Planarization and Crossing Minimization , 2010, GD.

[66]  Giorgio Terracina,et al.  Consistent query answering via ASP from different perspectives: Theory and practice , 2011, Theory and Practice of Logic Programming.

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

[68]  Martin Gebser,et al.  Complex optimization in answer set programming , 2011, Theory and Practice of Logic Programming.

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

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

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

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

[73]  Fangzhen Lin,et al.  ASSAT: computing answer sets of a logic program by SAT solvers , 2002, Artif. Intell..

[74]  Danny De Schreye,et al.  Answer Set Planning , 1999 .

[75]  Maurice Bruynooghe,et al.  SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions , 2008, SAT.

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

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

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

[79]  Jia-Huai You,et al.  Unfolding partiality and disjunctions in stable model semantics , 2000, TOCL.