= Competition Categories, Tracks and Benchmark Suite =

== Competition Categories ==
The Competition consists of two categories, each one featuring four tracks. In particular, the categories depend on the computational resources allowed:
 * '''One''' processor allowed (''SP'')
 * '''Multiple''' processors allowed (''MP'')
Of course parallel systems can participate in tracks of MP category, and similarly non-parallel systems can participate in tracks of SP category. The categorization deals with the allowed processors to a system for each run.


== Competition Tracks ==
The ASP Competition Series consisted usually of (sub)-Tracks conceived on the basis of the "complexity" of problems; in the light of the work spent by the community on language standardization, this edition takes rather into consideration language features.

As stated by the Call for Participation, according to the availability of benchmarks, to submitted systems, and to participants feedback, both categories of the competition is hence structured into four tracks:

 || '''Track #''' || '''Track Name''' || '''Track features''' ||
 || 1 || Basic || Basic Decision. Encodings: normal LP + simple arithmetic and comparison operators ||
 || 2 || Advanced || Advanced Decision. Encodings: full language, excepting optimization statements and non-HCF disjunction ||
 || 3 || Optimization || Optimization. Encodings: full language with optimization statements, excepting non-HCF disjunction ||
 || 4 || Unrestricted || Unrestricted. Encodings: full language ||


== Benchmark Suite ==

=== Track 1 ===
## Basic Decision Problems (only simple arithmetic and comparisons)
 * 15 Stable Marriage
 * 20 Visit-all
 * 22 Knight Tour with Holes
 * 24 Labyrinth
 * 26 Hanoi Tower
 * 27 Graph Colouring

=== Track 2 ===
## Enriched Decision Problems (aggregates, HCF disjunction, queries, choice rules marked with *)
 * 01 Permutation Pattern Matching
 * 05 Graceful Graphs
 * 06 Bottle Filling Problem
 * 07 Nomystery
 * 08 Sokoban
 * 09 Ricochet Robots
 * 11 Reachability
 * 13 Solitaire
 * 14 Weighted-Sequence Problem
 * 16 Incremental Scheduling
 * 17 Qualitative Spatial Reasoning
 * 20 Visit-all
 * 22 Knight Tour with Holes
 * 26 Hanoi Tower
 * 27 Graph Colouring
 * 28 Partner Units /* (Polynomial) */

=== Track 3 ===
## Optimization Problems (everything except non-HCF disjunction allowed, choice rules marked with *)
 * 02 Valves Location Problem
 * 04 Connected Maximum-density Still Life
 * 10 Crossing Minimization
 * 23 Maximal Clique Problem

=== Track 4 ===
## Second Level Problems (non-HCF disjunction, optimize marked with °, choice rules marked with *)
 * 12 Strategic Companies
 * 19 Abstract Dialectical Frameworks Well-founded Model
 * 21 Complex Optimization of Answer Sets
 * 25 Minimal Diagnosis