摘要翻译：
答案集编程(ASP)是一种成熟的声明性编程范式，与其他声明性形式化密切相关，如SAT模理论、约束处理规则、FO(.)、PDDL等。自从它的第一个非正式版本以来，ASP系统已经在现在成熟的ASP竞争中进行了比较。第三届（公开）ASP比赛是继德国波茨坦大学（2006-2007）和2009年比利时鲁汶大学举行的ASP比赛系列之后，于2011年上半年在卡拉布里亚大学（意大利）举行。参与者在预选的基准测试问题集合上进行竞争，这些问题来自各种领域以及现实世界的应用程序。竞赛在两个轨道上进行：模型和解决(M&S)轨道，基于开放的问题编码和开放的语言，以及对基于声明性规范范例的任何类型的系统开放；和系统跟踪，运行在固定的基础上，公开的问题编码，用标准的ASP语言编写。本文讨论了比赛的形式和背后的理由，然后报告了两个赛道的结果。最后讨论了与第二届ASP竞赛和一些基准域的最先进解决方案的比较。出现在逻辑程序设计(TPLP)的理论与实践中。
---
英文标题：
《The third open Answer Set Programming competition》
---
作者：
Francesco Calimeri, Giovambattista Ianni, Francesco Ricca
---
最新提交年份：
2012
---
分类信息：

一级分类：Computer Science        计算机科学
二级分类：Artificial Intelligence        人工智能
分类描述：Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域，除了视觉、机器人、机器学习、多智能体系统以及计算和语言（自然语言处理），这些领域有独立的学科领域。特别地，包括专家系统，定理证明（尽管这可能与计算机科学中的逻辑重叠），知识表示，规划，和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--

---
英文摘要：
  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).
---
PDF链接：
https://arxiv.org/pdf/1206.3111