Design and results of the Fifth Answer Set Programming Competition

Francesco Calimeri, Martin Gebser, Marco Maratea*, Francesco Ricca

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

90 Citations (Scopus)

Abstract

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. (C) 2015 Elsevier B.V. All rights reserved.

Original languageEnglish
Pages (from-to)151-181
Number of pages31
JournalArtificial Intelligence
Volume231
DOIs
Publication statusPublished - Feb 2016
MoE publication typeA1 Journal article-refereed

Keywords

  • Answer Set Programming
  • Solver competition
  • Computational logic
  • STABLE MODEL SEMANTICS
  • INTERNATIONAL PLANNING COMPETITION
  • LOGIC PROGRAMS
  • DLV SYSTEM
  • PROPOSITIONAL SATISFIABILITY
  • KNOWLEDGE REPRESENTATION
  • COMPLEXITY
  • SOLVERS
  • ASP

Cite this