welcome: please sign in
location: Diff for "CompetitionTracks"
Differences between revisions 1 and 11 (spanning 10 versions)
⇤ ← Revision 1 as of 2014-04-10 08:44:18 →
Size: 257
Editor: FrancescoCalimeri
Comment:
← Revision 11 as of 2014-05-07 11:02:55 → ⇥
Size: 3368
Editor: FrancescoCalimeri
Comment:
Deletions are marked like this. Additions are marked like this.
Line 1: Line 1:
UNDER CONSTRUCTION = Competition Categories, Tracks and Benchmark Suite =
Line 3: Line 3:
== TRACKS == <<TableOfContents>>
Line 5: Line 5:
 * Basic Encodings (normal lp + simple arithmetic and comparisons)
 * Advanced Encodings (everything but weak and nonHCF)
 * Optimization Encodings (everything, including weak, but nonHCF)
 * Unrestricted Encodings		 == 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 ==

=== 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

Competition Categories, Tracks and Benchmark Suite

Contents

  1. Competition Categories, Tracks and Benchmark Suite
    1. Competition Categories
    2. Competition Tracks
    3. Instance Selection
    4. Benchmark Suite
      1. Track 1
      2. Track 2
      3. Track 3
      4. Track 4

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 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).

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

Fifth Answer Set Programming Competition (ASPCOMP 2014): CompetitionTracks (last edited 2014-05-28 21:00:39 by FrancescoCalimeri)