welcome: please sign in
location: Diff for "ParticipantSubmission"
Differences between revisions 22 and 23
Revision 22 as of 2014-03-31 10:05:29
Size: 4523
Comment:
Revision 23 as of 2014-04-01 10:01:37
Size: 4624
Comment:
Deletions are marked like this. Additions are marked like this.
Line 19: Line 19:
The competition will run on a Debian Linux server (64bit kernel) running on Intel Xeon X5365 Processors with 4096KB of cache and 16GB of RAM.
(please note that 16GB is the total amount of memory available in the hardware but it is not the memory limit used for the competition)
# The competition will run on a Debian Linux server (64bit kernel) running on Intel Xeon X5365 Processors with 4096KB of cache and 16GB of RAM.
# (please note that 16GB is the total amount of memory available in the hardware but it is not the memory limit used for the competition)
Line 28: Line 28:
Your package should at least contain a folder named {{{bin}}}. Your package is expected
to be run with the same configuration for all the benchmark domains, i.e.,
the package must comprise all files required for running your system on any problem encoding and any problem instance.
Available SOON.
Line 32: Line 30:
{{{#!wiki caution
You must specify a single fixed software bundle capable
of accepting problem encodings written in the ASP-Core-2 format.
}}}
# Your package should at least contain a folder named {{{bin}}}. Your package is expected
# to be run with the same configuration for all the benchmark domains, i.e.,
# the package must comprise all files required for running your system on any problem encoding and any problem instance.
Line 37: Line 34:
The directory {{{bin}}} must contain an '''executable''' file called {{{run}}}, which will be invoked during the Competition run.
{{{
 .
 ├── bin
 │ ├── run
│ ├── mysolver
 │ └── my_helper_tool
 ├── lib
│ ├── libmysolver.so
 │ ├── libmysolver.so.4
 │ ├── libmysolver.so.4.0.1
 . .
 . .
 .
}}}
# {{{#!wiki caution
# You must specify a single fixed software bundle capable
# of accepting problem encodings written in the ASP-Core-2 format.
# }}}

#
The directory {{{bin}}} must contain an '''executable''' file called {{{run}}}, which will be invoked during the Competition run.
# {{{
 # .
 # ├── bin
 # │ ├── run
 #
│ ├── mysolver
 # │ └── my_helper_tool
 # ├── lib
 #
│ ├── libmysolver.so
 # │ ├── libmysolver.so.4
 # │ ├── libmysolver.so.4.0.1
 # . .
 # . .
 # .
# }}}
Line 54: Line 56:
This file can be a script invoking a binary executable, possibly using other scripts for pre- or post-processing provided in your package.
Don't forget to make your scripts and binaries executable using {{{chmod 755}}}.
# This file can be a script invoking a binary executable, possibly using other scripts for pre- or post-processing provided in your package.
# Don't forget to make your scripts and binaries executable using {{{chmod 755}}}.
Line 57: Line 59:
=== Input === # === Input ===
Line 59: Line 61:
A problem instance, '''together with an ASP-Core-2''' program, is fed to {{{run}}}'s standard input. The problem instance concatenated
with the ASP-Core-2 encoding complies with the ASP-Core-2 2.01c [[https://www.mat.unical.it/aspcomp2013/files/ASP-CORE-2.01c.pdf|grammar]].
# A problem instance, '''together with an ASP-Core-2''' program, is fed to {{{run}}}'s standard input. The problem instance concatenated
# with the ASP-Core-2 encoding complies with the ASP-Core-2 2.01c [[https://www.mat.unical.it/aspcomp2013/files/ASP-CORE-2.01c.pdf|grammar]].
Line 62: Line 64:
=== Command Line === # === Command Line ===
Line 64: Line 66:
{{{run}}} takes '''three''' arguments: # {{{run}}} takes '''three''' arguments:
Line 66: Line 68:
 * The first argument ({{{$1}}}, {{{argv[1]}}}, ...) is the maximum integer which is sufficient for solving the input instance ({{{0}}} if not meaningful for the problem/instance at hand).
 * The second argument ({{{$2}}}, {{{argv[2]}}}, ...) is the maximum nesting level of function symbols which is sufficient for solving the input instance ({{{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}}}. This list specifies which output predicates should be included in the output of the run script. Note that, for avoiding syntactic problem recognition techniques, predicate names might be masked/renamed and might not coincide with output predicate names listed in public problem specifications.
 # * The first argument ({{{$1}}}, {{{argv[1]}}}, ...) is the maximum integer which is sufficient for solving the input instance ({{{0}}} if not meaningful for the problem/instance at hand).
 # * The second argument ({{{$2}}}, {{{argv[2]}}}, ...) is the maximum nesting level of function symbols which is sufficient for solving the input instance ({{{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}}}. This list specifies which output predicates should be included in the output of the run script. Note that, for avoiding syntactic problem recognition techniques, predicate names might be masked/renamed and might not coincide with output predicate names listed in public problem specifications.
Line 70: Line 72:
Of course, the first two arguments can be taken into account or not by submitted scripts at participant's will and necessity (for instance, a system not having particular constraints on termination when function symbols
are into play, can ignore the second argument).
The third argument must be explicitly used for filtering and preparing output data such that the checker can verify your solution.
# Of course, the first two arguments can be taken into account or not by submitted scripts at participant's will and necessity (for instance, a system not having particular constraints on termination when function symbols
# are into play, can ignore the second argument).
# The third argument must be explicitly used for filtering and preparing output data such that the checker can verify your solution.
Line 74: Line 76:
=== Output === # === Output ===
Line 76: Line 78:
The output of {{{run}}} must be printed to standard output, and a proper
exit code must be issued, according to the format specified [[https://www.mat.unical.it/aspcomp2013/files/aspoutput.txt|here]].
# The output of {{{run}}} must be printed to standard output, and a proper
# exit code must be issued, according to the format specified [[https://www.mat.unical.it/aspcomp2013/files/aspoutput.txt|here]].
Line 79: Line 81:
An example of {{{run}}} script can be found [[https://www.mat.unical.it/aspcomp2013/files/links/aspexec/run|here]] # An example of {{{run}}} script can be found [[https://www.mat.unical.it/aspcomp2013/files/links/aspexec/run|here]]

Participant 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;
  • please indicate 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. my submission supports normal logic programs and aggregates, it does not support weak constraints and function symbols... and so on.

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

# The competition will run on a Debian Linux server (64bit kernel) running on Intel Xeon X5365 Processors with 4096KB of cache and 16GB of RAM. # (please note that 16GB is the total amount of memory available in the hardware but it is not the memory limit used for the competition)

Detailed submission instructions, competition rules, hardware and software settings will be published soon. Pease check this page frequently.

Directions for Submitting

Available SOON.

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

#

# You must specify a single fixed software bundle capable # of accepting problem encodings written in the ASP-Core-2 format. #

# The directory bin must contain an executable file called run, which will be invoked during the Competition run. #

 # .
 # ├── bin
 # │   ├── run
 # │   ├── mysolver
 # │   └── my_helper_tool
 # ├── lib 
 # │   ├── libmysolver.so
 # │   ├── libmysolver.so.4
 # │   ├── libmysolver.so.4.0.1
 # .   .
 # .   .
 # .
# 

# This file can be a script invoking a binary executable, possibly using other scripts for pre- or post-processing provided in your package. # Don't forget to make your scripts and binaries executable using chmod 755.

# === Input ===

# A problem instance, together with an ASP-Core-2 program, is fed to run's standard input. The problem instance concatenated # with the ASP-Core-2 encoding complies with the ASP-Core-2 2.01c grammar.

# === Command Line ===

# run takes three arguments:

  • # * The first argument ($1, argv[1], ...) is the maximum integer which is sufficient for solving the input instance (0 if not meaningful for the problem/instance at hand). # * The second argument ($2, argv[2], ...) is the maximum nesting level of function symbols which is sufficient for solving the input instance (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. This list specifies which output predicates should be included in the output of the run script. Note that, for avoiding syntactic problem recognition techniques, predicate names might be masked/renamed and might not coincide with output predicate names listed in public problem specifications.

# Of course, the first two arguments can be taken into account or not by submitted scripts at participant's will and necessity (for instance, a system not having particular constraints on termination when function symbols # are into play, can ignore the second argument). # The third argument must be explicitly used for filtering and preparing output data such that the checker can verify your solution.

# === Output ===

# The output of run must be printed to standard output, and a proper # exit code must be issued, according to the format specified here.

# An example of run script can be found here

Fifth Answer Set Programming Competition (ASPCOMP 2014): ParticipantSubmission (last edited 2014-04-01 10:15:54 by FrancescoCalimeri)