The Answer Set Programming Challenge 2019 will be run jointly among the Technische Universität Wien (Austria) and the University of Genoa (Italy), in Spring 2019. The event is the sequel to the ASP Competition series:
- 2007, University of Potsdam (Germany)
- 2009, University of Leuven (Belgium)
- 2011, University of Calabria (Italy)
- 2013, University of Calabria (Italy) and Technische Universität Wien (Austria)
- 2014, 2015, Aalto University (Finland), University of Calabria (Italy), University of Genoa (Italy)
- 2017, University of Potsdam (Germany), University of Calabria (Italy), University of Genoa (Italy).
Contact us at email@example.com.
This challenge has three aims:
- Invite the ASP community to face novel and challenging real-world/industrial benchmarks.
- Make it possible for all solvers and solver extensions to participate.
- Push the limits of ASP languages and solvers.
For that, we want to focus on solving problems, not programs:
- The organizing committee will select one or two problems for each area (see below for details), and participants will be required to provide a solution consisting of an encoding and a system for at least one of the problems.
- The solution may be based on any available ASP system (not necessarily developed by the participants), and the solution may use all features and extensions including (but not limited to) script languages, external sources, domain-specific heuristics, etc.
In more details, real-world/industrial problems in the following areas will be considered for the challenge:
- Decision problems (Answer set programming with search)
- Optimisation problems (Answer set programming with optimization)
- Problems involving continuous domains (Constraint answer set programming)
- Problems with grounding bottleneck
- Answer set programming and big data (Meant to be solved by querying the set of facts, which is accessible, e.g., as a database)