|
Size: 1365
Comment: First draft submission description
|
Size: 4667
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| ##acl EditorsGroup:read,write,revert,delete,admin All:read |
|
| Line 3: | Line 5: |
| <<TableOfContents>> | |
| Line 4: | Line 7: |
| === Application === | == Application Procedure == |
| Line 6: | Line 9: |
| The registration deadline is '''February 2, 2012 23:59 GMT'''. | Participants willing to apply for the competition can send an email (starting from March 1st, 2014) to this [[mailto:aspcomp2014@mat.unical.it|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. |
| Line 8: | Line 17: |
| Teams willing to participate in the competition can register via Easychair. The registration procedure is as follows: * go to http://www.easychair.org/conferences/?conf=aspcomp2013 * click '''New Submission''' * add all names, email addresses, and affiliations of the team members in the '''Author i''' entries * put the name of their team in the '''Title''' entry; * add a small description of your system to the '''Abstract''' entry; * choose the category: tick '''Model & Solve Track Participant Package''' or '''System Track Participant Package''' if you want to participate in the Model & Solve or in the System track, resp.; * add a few keywords that describe the features of your system; and * tick '''Abstract Only'''. |
Applicants will get a private e-mail with the instructions for submitting systems and login credentials for accessing our Competition server through ssh. |
| Line 19: | Line 19: |
| Then click on the '''Submit''' button. We will then get in contact with you for the further procedure. |
## 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. |
| Line 23: | Line 25: |
| === Instructions for testing and submitting systems and benchmarks === | <<Anchor(System)>> == Directions for Submitting == |
| Line 25: | Line 28: |
| tba. | Available SOON. |
| Line 27: | Line 30: |
| <<Anchor(MSComp)>> == Model & Solve Competition == |
## 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 30: | Line 34: |
| tba. | ## {{{##!wiki caution ## You must specify a single fixed software bundle capable ## of accepting problem encodings written in the ASP-Core-2 format. ## }}} |
| Line 32: | Line 39: |
| <<Anchor(System)>> == System Competition == |
## 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 35: | Line 55: |
| tba. | |
| Line 37: | Line 56: |
| == Submission Process (both Competitions) == | ## 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 39: | Line 59: |
| Once you have registered with Easychair, you can upload your system package as ZIP file. | ## === Input === |
| Line 41: | Line 61: |
| Further details announced soon. | ## 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]]. ## === 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 [[https://www.mat.unical.it/aspcomp2013/files/aspoutput.txt|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.
Detailed submission instructions, competition rules, hardware and software settings will be published soon. Pease check this page frequently.
Directions for Submitting
Available SOON.
- ## . ## ├── bin ## │ ├── run ## │ ├── mysolver ## │ └── my_helper_tool ## ├── lib ## │ ├── libmysolver.so ## │ ├── libmysolver.so.4 ## │ ├── libmysolver.so.4.0.1 ## . . ## . . ## .
## * 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.