= Competition Categories, Tracks and Benchmark Suite =

<<TableOfContents>>

== 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 are hence structured into four tracks:

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


== Instance Selection ==
Instances have been randomly selected from the already available official ASPCOMP 2013 suite: the piece of software used for this task is available [[attachment:instance-selector.zip|here]]. The seed used for randomization is '''13152024460108''', as the concatenation of the winning numbers of the Euromillion lottery of Tuesday, 22nd April 2014 (see [[http://www.euro-millions.com/results.asp|Euromillion Lottery website]]).


== Benchmark Suite ==
'''Note''': For descriptions and further details about problems please refer to the [[https://www.mat.unical.it/aspcomp2013/OfficialProblemSuite|ASPCOMP 2013 Official Problem Suite]], except for ''Partner Units'', that comes from the [[https://www.mat.unical.it/aspcomp2011/OfficialProblemSuite|ASPCOMP 2011 Official Problem Suite]]. 

<<BR>>

|| '''Track'''	|| '''ID'''	|| '''Problem''' ||
|| 1		|| 15		|| Stable Marriage ||
|| 1		|| 20		|| Visit-all ||
|| 1		|| 22		|| Knight Tour with Holes ||
|| 1		|| 24		|| Labyrinth ||
|| 1		|| 26		|| Hanoi Tower ||
|| 1		|| 27		|| Graph Colouring ||
|| 2		|| 01		|| Permutation Pattern Matching ||
|| 2		|| 05		|| Graceful Graphs ||
|| 2		|| 06		|| Bottle Filling Problem ||
|| 2		|| 07		|| Nomystery ||
|| 2		|| 08		|| Sokoban ||
|| 2		|| 09		|| Ricochet Robots ||
|| 2		|| 11		|| Reachability ||
|| 2		|| 13		|| Solitaire ||
|| 2		|| 14		|| Weighted-Sequence Problem ||
|| 2		|| 16		|| Incremental Scheduling ||
|| 2		|| 17		|| Qualitative Spatial Reasoning ||
|| 2		|| 20		|| Visit-all ||
|| 2		|| 22		|| Knight Tour with Holes ||
|| 2		|| 26		|| Hanoi Tower ||
|| 2		|| 27		|| Graph Colouring ||
|| 2		|| 28		|| Partner Units (Polynomial) ||
|| 3		|| 02		|| Valves Location Problem ||
|| 3		|| 04		|| Connected Maximum-density Still Life ||
|| 3		|| 10		|| Crossing Minimization ||
|| 3		|| 23		|| Maximal Clique Problem ||
|| 4		|| 12		|| Strategic Companies ||
|| 4		|| 19		|| Abstract Dialectical Frameworks Well-founded Model ||
|| 4		|| 21		|| Complex Optimization of Answer Sets ||
|| 4		|| 25		|| Minimal Diagnosis ||