welcome: please sign in
location: Diff for "FrontPage"
Differences between revisions 90 and 91
Revision 90 as of 2014-05-28 20:33:08
Size: 7352
Comment: swap some sections
Revision 91 as of 2014-05-28 21:02:09
Size: 10981
Comment:
Deletions are marked like this. Additions are marked like this.
Line 41: Line 41:
Please find details [[CompetitionTracks|here]]. ##Please find details [[CompetitionTracks|here]].

=== 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 44: Line 50:
=== 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 ||

Fifth Answer Set Programming Competition (ASPCOMP 2014)

The Fifth Answer Set Programming Competition (ASPCOMP 2014) will take place as one of the events within the FLoC Olympic Games, held in Vienna in the context of the Vienna Summer of Logic 2014. The event is officially affiliated with the 30th International Conference on Logic Programming (ICLP 2014).

News and updates

  • 15 April, 2014: Competition Format and Benchmark suite unveiled!
  • 14 April, 2014: More details about rules.
  • 08 April, 2014: Application procedure updated, submission procedure published.
  • 31 March, 2014: Application procedure updated
  • 14 March, 2014: Important dates updated
  • 20 February, 2014: Application directions now available, registration opens March 1st, 2014.
  • 11 February, 2014: Call for Participation updated. Please check it out!
  • 03 February, 2014: Announcement - ASPCOMP 2014 is officially affiliated with the 30th International Conference on Logic Programming (ICLP 2014).

  • 03 February, 2014: Call for participation updated.
  • 13 January, 2014: Preliminary Call for Participation out.

Call for Participation

  • Please find the official Call for Participation here.

Important Dates

NOTE: Due to the nature of the competition, schedule can be subject to further modification. Please check this site out often for news and updates.

  • March 1st, 2014: Participant registration opens
  • March 31st, 2014: Participant registration closes (new)
  • April 16th, 2014: Competition server closes to participants
  • April 16th, 2014: The competition starts (extended)
  • July 2014: Awards are presented at FLoC (22nd) and at ICLP (19th-22nd)

Competition Format 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

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

Note: For descriptions and further details about problems please refer to the ASPCOMP 2013 Official Problem Suite, except for Partner Units, that comes from the ASPCOMP 2011 Official Problem Suite.


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

Rules, Scoring and Details

Rules and Scoring

Please find details about rules and scoring here.

Input/Output format

Input and Output formats do not significantly change with respect to ASPCOMP 2013.

Input format

Input format do not change w.r.t. last edition. Please find further info via the official ASPCOMP 2013 website:

Output format

Expected output is almost the same as the one from last edition: see note below. Please find last specs via the official ASPCOMP 2013 website:

Note

Exit Code 30 is now allowed also in case of decision problems.

Please have a look at the ASPCOMP 2013 ASP standardization page.

Application and Submission Procedure

Application Procedure

Participants willing to apply for the competition can send an email (starting from March 1st, 2014) to this address specifying:

  • the name of their team;
  • names and affiliation of the team members (institution, research group);
  • name and number of the systems the team will submit;
  • specification about whether a system is an updated version of a solution submitted to the 2013 edition;
  • specific software requirements: e.g. linux packages/libraries needed to run your system.
  • language support: e.g. <<our submission supports normal logic programs and aggregates, it does not support weak constraints and function symbol>>, or so, etc.

Applicants will get a private e-mail with the instructions for submitting systems and login credentials for accessing our Competition server through ssh.

System Package(s) submission

Once received the instructions via e-mail, participants can log in onto the competition hardware system, and are free to use their account for building, testing, and submitting systems packages purposes; access is avalaible until the day before the competition starts.

In order to properly submit a system package, participants must create a sub-directory with the name of the system at hand in the directory "submission" of their home. In case of several systems submissions, participants must create a sub-directory for each system.

Reminder: participants can log in and update their submission until the competition starts. Please check the deadline out in the above section.

Package Structure

The structure of each submission package must be the following:

    system-name
      └ bin
          └ run
          └ mysolver
          └ my_helper_tool

A package should contain at least a folder named bin. The package is expected to be launched with the same configuration for all the benchmark domains, i.e., the package must comprise all files required for running the submitted system, on any problem encoding and any problem instance.

Command Line

The main script "run" takes three arguments:

  • The first argument ($1, argv[1], ...) is the maximum integer (0 if not meaningful for the problem/instance at hand).
  • The second argument ($2, argv[2], ...) is the maximum nesting level of functional terms (0 if not meaningful for the problem/instance at hand).
  • The third argument ($3, argv[3], ...) is a comma-separated list of output predicates p1/n1, p2/n2,... with predicate names pi and arities ni. The list coincides with the list of output predicates which are allowed in the output of the run script. For each domain, the list can be found in the related checker folder, for convenience.

Of course, participants are free to design submitted scripts in order to take into account the three arguments, or not.

A problem instance in the prescribed format is fed to run's standard input. The output of each run must be printed to standard output, and a proper exit code must be issued, according to the competition format.

More details on input and output are available in the proper section.

An example of run script is available here.

Contacts

Organizing Committee

The Fifth Answer Set Programming Competition is hosted and regulated jointly by Aalto University (Finland), University of Calabria (Italy) and University of Genova (Italy).

Co-Chairs

Email and Contacts

Fifth Answer Set Programming Competition (ASPCOMP 2014): FrontPage (last edited 2015-08-06 10:02:44 by FrancescoCalimeri)