The Sixth Answer Set Programming Competition

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.

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

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

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

[4]  John S. Schlipf,et al.  Answer Set Programming with Clause Learning , 2004, LPNMR.

[5]  Da Shen,et al.  SMT-based Constraint Answer Set Solver EZSMT+ , 2019, ArXiv.

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

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

[8]  Martin Gebser,et al.  Detecting inconsistencies in large biological networks with answer set programming , 2008, Theory and Practice of Logic Programming.

[9]  Mario Alviano,et al.  Optimum stable model search: algorithms and implementation , 2020, J. Log. Comput..

[10]  F. RICCA,et al.  Team-building with answer set programming in the Gioia-Tauro seaport , 2011, Theory and Practice of Logic Programming.

[11]  Joohyung Lee,et al.  Loop Formulas for Disjunctive Logic Programs , 2003, ICLP.

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

[13]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[14]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[15]  Tommi Syrjänen.  Omega-Restricted Logic Programs , 2001, LPNMR.

[16]  Michael Gelfond,et al.  The USA-Advisor: A Case Study in Answer Set Planning , 2001, LPNMR.

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

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

[19]  Martin Gebser,et al.  GrinGo : A New Grounder for Answer Set Programming , 2007, LPNMR.

[20]  Peter J. Stuckey,et al.  Lazy Model Expansion: Interleaving Grounding with Search , 2014, J. Artif. Intell. Res..

[21]  Alex M. Andrew,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2004 .

[22]  Niklas Sörensson,et al.  Temporal induction by incremental SAT solving , 2003, BMC@CAV.

[23]  Gerald Pfeifer,et al.  Enhancing disjunctive logic programming systems by SAT checkers , 2003, Artif. Intell..

[24]  Geoff Sutcliffe.  The TPTP Problem Library and Associated Infrastructure , 2017, Journal of Automated Reasoning.

[25]  Lukás Chrpa,et al.  The 2014 International Planning Competition: Progress and Trends , 2015, AI Mag..

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

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

[28]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

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

[30]  Maria Paola Bonacina,et al.  PSATO: a Distributed Propositional Prover and its Application to Quasigroup Problems , 1996, J. Symb. Comput..

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

[32]  Marius Thomas Lindauer,et al.  claspfolio 2: Advances in Algorithm Selection for Answer Set Programming , 2014, Theory and Practice of Logic Programming.

[33]  Geoff Sutcliffe.  The 8th IJCAR automated theorem proving system competition - CASC-J8 , 2016, AI Commun..

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

[35]  Michael Gelfond,et al.  An A Prolog decision support system for the Space Shuttle , 2001, Answer Set Programming.

[36]  Torsten Schaub,et al.  ASP modulo CSP: The clingcon system , 2012, Theory and Practice of Logic Programming.

[37]  Martin Gebser,et al.  Advances in gringo Series 3 , 2011, LPNMR.

[38]  Luca Pulina,et al.  Multi-engine ASP solving with policy adaptation , 2015, J. Log. Comput..

[39]  Joohyung Lee,et al.  A Model-Theoretic Counterpart of Loop Formulas , 2005, IJCAI.

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

[41]  Yuliya Lierler,et al.  Disjunctive Answer Set Programming via Satisfiability , 2005, Answer Set Programming.

[42]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

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

[44]  Sharad Malik,et al.  Efficient conflict driven learning in a Boolean satisfiability solver , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

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

[46]  Leopoldo E. Bertossi,et al.  Logic Programs for Consistently Querying Data Integration Systems , 2003, IJCAI.

[47]  Wolfgang Faber,et al.  Pruning Operators for Disjunctive Logic Programming Systems , 2006, Fundam. Informaticae.

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

[49]  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).

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

[51]  Wolfgang Faber,et al.  Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity , 2004, JELIA.

[52]  J. P. Marques,et al.  GRASP : A Search Algorithm for Propositional Satisfiability , 1999 .

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

[54]  Mario Alviano,et al.  Reduct-based Stability Check Using Literal Assumptions , 2015, ICLP 2015.

[55]  Ilkka Niemelä,et al.  Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs , 2002, JELIA.

[56]  Gerald Pfeifer,et al.  Improving the Model Generation/Checking Interplay to Enhance the Evaluation of Disjunctive Programs , 2004, LPNMR.

[57]  Michael Gelfond,et al.  Applications of Answer Set Programming , 2016, AI Mag..

[58]  Maurice Bruynooghe,et al.  Detection and exploitation of functional dependencies for model generation , 2013, Theory and Practice of Logic Programming.

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

[60]  Nicola Leone,et al.  An ASP-Based System for e-Tourism , 2009, LPNMR.

[61]  Wolfgang Faber,et al.  The Intelligent Grounder of DLV , 2012, Correct Reasoning.

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

[63]  Marcello Balduccini,et al.  Representing Constraint Satisfaction Problems in Answer Set Programming , 2022 .

[64]  Chitta Baral,et al.  Declarative Specification and Solution of Combinatorial Auctions Using Logic Programming , 2001, LPNMR.

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

[66]  Chitta Baral,et al.  Reasoning agents in dynamic domains , 2000 .

[67]  Helmut Veith,et al.  Vienna Summer of Logic , 2014, KR.

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

[69]  Marius Thomas Lindauer,et al.  aspeed: Solver scheduling via answer set programming 1 , 2014, Theory and Practice of Logic Programming.

[70]  Martin Gebser,et al.  Answer Set Solving in Practice , 2012, Answer Set Solving in Practice.

[71]  Tomi Janhunen,et al.  Some (in)translatability results for normal logic programs and propositional theories , 2006, J. Appl. Non Class. Logics.

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

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

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

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

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

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

[78]  Michael Gelfond,et al.  Integrating Answer Set Reasoning with Constraint Solving Techniques , 2008, FLOPS.

[79]  Enrico Pontelli,et al.  Non-monotonic Reasoning on Beowulf Platforms , 2003, PADL.

[80]  Victor A. Bardadym.  Computer-Aided School and University Timetabling: The New Wave , 1995, PATAT.

[81]  Armin Biere,et al.  Evaluating CDCL Variable Scoring Schemes , 2015, SAT.

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

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

[84]  Luca Pulina,et al.  A self-adaptive multi-engine solver for quantified Boolean formulas , 2009, Constraints.

[85]  Johan Wittocx,et al.  GidL: A grounder for FO+ , 2008, Non-Monotonic Reasoning.

[86]  Wolfgang Faber,et al.  Semantics and complexity of recursive aggregates in answer set programming , 2011, Artif. Intell..

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

[88]  Toby Walsh,et al.  A translational approach to constraint answer set solving , 2010, Theory Pract. Log. Program..

[89]  Alexander A. Razborov,et al.  Why are there so many loop formulas? , 2006, TOCL.

[90]  Bettina Schnor,et al.  Cluster-Based ASP Solving with claspar , 2011, LPNMR.

[91]  Bernd Bischl,et al.  ASlib: A benchmark library for algorithm selection , 2015, Artif. Intell..

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

[93]  Esra Erdem,et al.  Applications of Answer Set Programming in Phylogenetic Systematics , 2011, Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning.

[94]  Jinbo Huang,et al.  The Effect of Restarts on the Efficiency of Clause Learning , 2007, IJCAI.

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

[96]  Giorgio Terracina,et al.  Taming primary key violations to query large inconsistent data via ASP , 2015, Theory and Practice of Logic Programming.

[97]  Victor W. Marek,et al.  Computing stable models in parallel , 2001, Answer Set Programming.

[98]  Enrico Pontelli,et al.  Issues in parallel execution of non-monotonic reasoning systems , 2005, Parallel Comput..

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

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

[101]  John R. Rice,et al.  The Algorithm Selection Problem , 1976, Adv. Comput..

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

[103]  Kevin Leyton-Brown,et al.  SATzilla: Portfolio-based Algorithm Selection for SAT , 2008, J. Artif. Intell. Res..

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

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

[106]  Luigi Palopoli,et al.  Exploiting agents in e-learning and skills management context , 2006, AI Commun..

[107]  Ilkka Niemelä,et al.  Computing Stable Models via Reductions to Difference Logic , 2009, LPNMR.

[108]  Ilkka Niemelä,et al.  Stable models and difference logic , 2008, Annals of Mathematics and Artificial Intelligence.

[109]  Torsten Schaub,et al.  Grounding and Solving in Answer Set Programming , 2016, AI Mag..

[110]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

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

[112]  Torsten Schaub,et al.  Modeling Biological Networks by Action Languages via Answer Set Programming , 2008, Constraints.

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

[114]  Wolfgang Faber,et al.  A backjumping technique for Disjunctive Logic Programming , 2006, AI Commun..

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

[116]  Robert E. Mercer,et al.  On Probing and Multi-Threading in Platypus , 2006, ECAI.

[117]  Francesco Scarcello,et al.  Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation , 1997, Inf. Comput..

[118]  James M. Crawford,et al.  Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems , 1994, AAAI.

[119]  Vladimir Lifschitz,et al.  Computing answer sets using program completion , 2003 .

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

[121]  Mario Alviano,et al.  Magic Sets for disjunctive Datalog programs , 2012, Artif. Intell..

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

[123]  Joao Marques-Silva,et al.  Iterative and core-guided MaxSAT solving: A survey and assessment , 2013, Constraints.

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

[125]  Wolfgang Faber,et al.  The INFOMIX system for advanced integration of incomplete and inconsistent data , 2005, SIGMOD '05.

[126]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[127]  Agostino Dovier,et al.  A GPU Implementation of the ASP Computation , 2016, PADL.

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

[129]  Mutsunori Banbara,et al.  Compiling Finite Linear CSP into SAT , 2006, CP.

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

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

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

[133]  Francesco Ricca,et al.  Parallel instantiation of ASP programs: techniques and experiments , 2013, Theory Pract. Log. Program..

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