The third open answer set programming competition
The third open answer set programming competition
复制标题
第三届公开答题集编程竞赛
DOI：
10.1017/s1471068412000105
复制
发表时间：
2012
影响因子：
1.4
通讯作者：
F. Ricca
中科院分区：
文献类型：
--
作者：
Francesco Calimeri;Giovambattista Ianni;F. Ricca
抽象回答集编程（ASP）是声明式编程的一个良好建立的范例，与其他声明式形式主义（如SAT模理论、约束处理规则、FO（.）PDDL和许多其他人。自从第一个非正式版本以来，ASP系统已经在现在已经建立的ASP竞赛中进行了比较。第三届（公开）ASP竞赛是在德国波茨坦大学（2006-2007年）和比利时鲁汶大学（2009年）举办的ASP竞赛系列的续集，于2011年上半年在卡拉布里亚大学（意大利）举行。参与者在预先选择的基准问题集合上进行竞争，这些问题来自各个领域以及真实的世界应用。竞赛分为两个部分：模型和求解（M&S）部分，基于开放的问题编码和开放的语言，对任何基于声明式规范范式的系统开放;系统部分，基于固定的公共问题编码，用标准ASP语言编写。本文讨论了比赛的形式和背后的理由，然后报告了两个轨道的结果。与第二次ASP竞争和国家的最先进的解决方案的一些基准域的比较，最终进行了讨论。
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.