Design and results of the Fifth Answer Set Programming Competition

详细信息    查看全文

• 作者：Francesco Calimeri^a ; ^{calimeri@mat.unical.it" class="auth_mail" title="E-mail the corresponding author} ; Martin Gebser^b ; ¹ ; ^{martin.gebser@aalto.fi" class="auth_mail" title="E-mail the corresponding author} ; Marco Maratea^c ; ^{marco@dibris.unige.it" class="auth_mail" title="E-mail the corresponding author} ; Francesco Ricca^a ; ^{ricca@mat.unical.it" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Answer Set Programming ; Solver competition ; Computational logic
• 刊名：Artificial Intelligence
• 出版年：2016
• 出版时间：February 2016
• 年：2016
• 卷：231
• 期：Complete
• 页码：151-181
• 全文大小：1400 K

文摘

Answer Set Programming (ASP) is a well-established paradigm of declarative programming that has been developed in the field of logic programming and non-monotonic reasoning. Advances in ASP solving technology are customarily assessed in competition events, as it happens for other closely related problem solving areas such as Boolean Satisfiability, Satisfiability Modulo Theories, Quantified Boolean Formulas, Planning, etc. This paper reports about the fifth edition of the ASP Competition by covering all aspects of the event, ranging from the new design of the competition to an in-depth analysis of the results. The paper comprises also additional analyses that were conceived for measuring the progress of the state of the art, as well as for studying aspects orthogonal to solving technology, such as the effects of modeling. A detailed picture of the progress of the state of the art in ASP solving is drawn, and the ASP Competition is located in the spectrum of related events.