The Second Answer Set Programming Competition

  • Authors:

  • Marc Denecker;Joost Vennekens;Stephen Bond;Martin Gebser;Mirosław Truszczyński

  • Affiliations:

  • Department of Computer Science, Katholieke Universiteit Leuven, Heverlee B-3001;Department of Computer Science, Katholieke Universiteit Leuven, Heverlee B-3001;Department of Computer Science, Katholieke Universiteit Leuven, Heverlee B-3001;Institut für Informatik, Universität Potsdam, Potsdam, Germany D-14482;Department of Computer Science, University of Kentucky, Lexington, USA 40506-0046

  • Venue:
  • LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.