The Answer Set Programming Competition

The Answer Set Programming (ASP) Competition is a biannual event for evaluating declarative knowledge representation systems on hard and demanding AI problems. The competition consists of two main tracks: the ASP system track and the model and solve track. The traditional system track compares dedicated answer set solvers on ASP benchmarks, while the model and solve track invites any researcher and developer of declarative knowledge representation systems to participate in an open challenge for solving sophisticated AI problems with their tools of choice. This article provides an overview of the ASP competition series, reviews its origins and history, giving insights on organizing and running such an elaborate event, and briefly discusses about the lessons learned so far.

[1]  Marius Thomas Lindauer,et al.  Potassco: The Potsdam Answer Set Solving Collection , 2011, AI Commun..

[2]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

[3]  Mario Alviano,et al.  Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates , 2011, J. Artif. Intell. Res..

[4]  Nicola Leone,et al.  ASP at Work: Spin-off and Applications of the DLV System , 2011, Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning.

[5]  José Júlio Alferes,et al.  Classical Negation in Logic Programs , 1990 .

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

[7]  Miroslaw Truszczynski,et al.  Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative , 2004, LPNMR.

[8]  Miroslaw Truszczynski,et al.  The First Answer Set Programming System Competition , 2007, LPNMR.

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

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

[11]  Miroslaw Truszczynski,et al.  The Second Answer Set Programming Competition , 2009, LPNMR.

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

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

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

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

[16]  Victor W. Marek,et al.  The Logic Programming Paradigm: A 25-Year Perspective , 2011 .

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

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

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

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

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