The third open answer set programming competition
- 6 September 2012
- journal article
- research article
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 14 (1) , 117-135
Abstract
Answer Set Programming (ASP) is a well-established paradigm of declarative programming in close relationship with other declarative formalisms such as SAT Modulo Theories, Constraint Handling Rules, FO(.), PDDL and many others. Since its first informal editions, ASP systems have been compared in the now well-established ASP Competition. The Third (Open) ASP Competition, as the sequel to the ASP Competitions Series held at the University of Potsdam in Germany (2006–2007) and at the University of Leuven in Belgium in 2009, took place at the University of Calabria (Italy) in the first half of 2011. Participants competed on a pre-selected collection of benchmark problems, taken from a variety of domains as well as real world applications. The Competition ran on two tracks: the Model and Solve (M&S) Track, based on an open problem encoding, and open language, and open to any kind of system based on a declarative specification paradigm; and the System Track, run on the basis of fixed, public problem encodings, written in a standard ASP language. This paper discusses the format of the competition and the rationale behind it, then reports the results for both tracks. Comparison with the second ASP competition and state-of-the-art solutions for some of the benchmark domains is eventually discussed.Keywords
All Related Versions
This publication has 43 references indexed in Scilit:
- A logic of nonmonotone inductive definitionsACM Transactions on Computational Logic, 2008
- Solving SAT and SAT Modulo TheoriesJournal of the ACM, 2006
- The DLV system for knowledge representation and reasoningACM Transactions on Computational Logic, 2006
- Some (in)translatability results for normal logic programs and propositional theoriesJournal of Applied Non-Classical Logics, 2006
- ASSAT: computing answer sets of a logic program by SAT solversArtificial Intelligence, 2004
- A fast algorithm for the maximum clique problemDiscrete Applied Mathematics, 2002
- Complexity and expressive power of logic programmingACM Computing Surveys, 2001
- Tabled evaluation with delaying for general logic programsJournal of the ACM, 1996
- Mixed integer programming methods for computing nonmonotonic deductive databasesJournal of the ACM, 1994
- Approximating maximum independent sets by excluding subgraphsBIT Numerical Mathematics, 1992