The third open Answer Set Programming competition
Preprint
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. To appear in Theory and Practice of Logic Programming (TPLP).Keywords
All Related Versions
- Version 1, 2012-06-14, ArXiv
- Version 1, 2014-05-15, ArXiv (Unconfirmed version)
- Version 2, 2014-05-16, ArXiv (Unconfirmed version)
- Version 3, 2014-05-26, ArXiv (Unconfirmed version)
- Version 4, 2014-06-03, ArXiv (Unconfirmed version)
- Published version: Theory and Practice of Logic Programming, 14 (1), 117.
This publication has 37 references indexed in Scilit:
- A Simple Distributed Conflict-Driven Answer Set Solver2009
- A First Order Forward Chaining Approach for Answer Set ComputingLecture Notes in Computer Science, 2009
- Computing Stable Models via Reductions to Difference LogicLecture Notes in Computer Science, 2009
- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions2008
- The First Answer Set Programming System Competition2007
- Flexible Pattern Discovery with (Extended) Disjunctive Logic ProgrammingLecture Notes in Computer Science, 2005
- DPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic2005
- Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity2004
- Census Data Repair: A Challenging Application of Disjunctive Logic Programming2001
- An A-Prolog Decision Support System for the Space Shuttle2001