# The Seventh Answer Set Programming Competition: Design and Results

**Authors:** Martin Gebser, Marco Maratea, Francesco Ricca

arXiv: 1904.09134 · 2020-02-19

## TL;DR

The paper details the design and outcomes of the Seventh Answer Set Programming Competition, providing benchmarks and assessing progress in ASP solving techniques within the logic programming community.

## Contribution

It introduces the structure, challenges, and results of the latest ASP competition, highlighting advancements and benchmarking in ASP solving.

## Key findings

- Benchmark collections for ASP improved
- ASP solver performance advanced
- New challenges identified for future ASP research

## Abstract

Answer Set Programming (ASP) is a prominent knowledge representation language with roots in logic programming and non-monotonic reasoning. Biennial ASP competitions are organized in order to furnish challenging benchmark collections and assess the advancement of the state of the art in ASP solving.   In this paper, we report on the design and results of the Seventh ASP Competition, jointly organized by the University of Calabria (Italy), the University of Genova (Italy), and the University of Potsdam (Germany), in affiliation with the 14th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR 2017). (Under consideration for acceptance in TPLP).

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1904.09134/full.md

## Figures

17 figures with captions in the complete paper: https://tomesphere.com/paper/1904.09134/full.md

## References

57 references — full list in the complete paper: https://tomesphere.com/paper/1904.09134/full.md

---
Source: https://tomesphere.com/paper/1904.09134