Chapter

Logic Programming and Nonmonotonic Reasoning

Volume 5753 of the series Lecture Notes in Computer Science pp 637-654

The Second Answer Set Programming Competition

  • Marc DeneckerAffiliated withDepartment of Computer Science, Katholieke Universiteit Leuven
  • , Joost VennekensAffiliated withDepartment of Computer Science, Katholieke Universiteit Leuven
  • , Stephen BondAffiliated withDepartment of Computer Science, Katholieke Universiteit Leuven
  • , Martin GebserAffiliated withInstitut für Informatik, Universität Potsdam
  • , Mirosław TruszczyńskiAffiliated withDepartment of Computer Science, University of Kentucky

* Final gross prices may vary according to local VAT.

Get Access

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.