|
Size: 2298
Comment:
|
Size: 3345
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| = Competition Tracks and Benchmark Suite = | = 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. |
| Line 4: | Line 11: |
| Line 7: | Line 13: |
| As stated by the Call for Participation, according to the availability of benchmarks, to submitted systems, and to participants feedback, the competition is hence structured into four tracks: | 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: |
| Line 9: | Line 15: |
| || 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 || |
|| '''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 || |
| Line 43: | Line 50: |
| * 28 Partner Units (Polynomial) | * 28 Partner Units /* (Polynomial) */ |
| Line 58: | Line 65: |
== 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]]). |
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 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
Benchmark Suite
Track 1
- 15 Stable Marriage
- 20 Visit-all
- 22 Knight Tour with Holes
- 24 Labyrinth
- 26 Hanoi Tower
- 27 Graph Colouring
Track 2
- 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
Track 3
- 02 Valves Location Problem
- 04 Connected Maximum-density Still Life
- 10 Crossing Minimization
- 23 Maximal Clique Problem
Track 4
- 12 Strategic Companies
- 19 Abstract Dialectical Frameworks Well-founded Model
- 21 Complex Optimization of Answer Sets
- 25 Minimal Diagnosis
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 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 Euromillion Lottery website).