The Second Answer Set Programming Competition

This paper reports on the Second Answer Set Programming Competition . The competitions in areas of Satisfiability checking, Pseudo-Boolean constraint solving and Quantified Boolean Formula evaluation have proven to be a strong driving force for a community to develop better performing systems. Following this experience, the Answer Set Programming competition series was set up in 2007, and ran as part of the International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR). This second competition, held in conjunction with LPNMR 2009, differed from the first one in two important ways. First, while the original competition was restricted to systems designed for the answer set programming language , the sequel was open to systems designed for other modeling languages, as well. Consequently, among the contestants of the second competition were a CLP(FD) team and three model generation systems for (extensions of) classical logic. Second, this latest competition covered not only satisfiability problems but also optimization ones. We present and discuss the set-up and the results of the competition.

[1]  Toby Walsh,et al.  Handbook of satisfiability , 2009 .

[2]  J. McCarthy.  CIRCUMSCRIPTION — A FORM OF NONMONOTONIC REASONING , 2007 .

[3]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[4]  Alan Bundy,et al.  Proofs About Lists Using Ellipsis , 1999, LPAR.

[5]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

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

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

[8]  Paul W. H. Chung,et al.  Proceedings of the Sixth International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems , 1993 .

[9]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[10]  Antonis C. Kakas,et al.  Air-Crew Scheduling through Abduction , 1999, IEA/AIE.

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

[12]  Antonis C. Kakas,et al.  Computational Logic: Logic Programming and Beyond , 2002, Lecture Notes in Computer Science.

[13]  Cesare Tinelli,et al.  Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T) , 2006, JACM.

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

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

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

[17]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[18]  Gerald Pfeifer,et al.  A Deductive System for Non-Monotonic Reasoning , 1997, LPNMR.

[19]  Antonis C. Kakas,et al.  Abduction in logic programming , 2002 .

[20]  David G. Mitchell,et al.  A Framework for Representing and Solving NP Search Problems , 2005, AAAI.

[21]  Ilkka Niemelä,et al.  Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP , 1997, LPNMR.

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

[23]  Marc Denecker,et al.  Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison , 2000, LPAR.

[24]  Robert A. Kowalski,et al.  Predicate Logic as Programming Language , 1974, IFIP Congress.

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