TY - GEN
T1 - The second answer set programming competition
AU - Denecker, Marc
AU - Vennekens, Joost
AU - Bond, Stephen
AU - Gebser, Martin
AU - Truszczyński, Mirosław
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=70349852764&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70349852764&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-04238-6_75
DO - 10.1007/978-3-642-04238-6_75
M3 - Conference contribution
AN - SCOPUS:70349852764
SN - 3642042376
SN - 9783642042379
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 637
EP - 654
BT - Logic Programming and Nonmonotonic Reasoning - 10th International Conference, LPNMR 2009, Proceedings
T2 - 10th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2009
Y2 - 14 September 2009 through 18 September 2009
ER -