Author:
CALIMERI FRANCESCO,IANNI GIOVAMBATTISTA,RICCA FRANCESCO
Abstract
AbstractAnswer 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.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Reference102 articles.
1. Xu K. since 2004. BHOSLIB: Benchmarks with hidden optimum solutions for graph problems. http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/graph-benchmarks.htm.
2. Consistency of Clark's completion and existence of stable models;Fages;Journal of Methods of Logic in Computer Science,1994
3. A logic-based system for e-Tourism;Ricca;FI,2010
4. Tabled evaluation with delaying for general logic programs
5. Balduccini M. , Gelfond M. , Watson R. and Nogeira M. 2001. The USA-Advisor: A case study in answer set planning. In LPNMR 2001. LNCS 2173, 439–442.
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献