|
Size: 7004
Comment:
|
Size: 3900
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 3: | Line 3: |
| ** UNDER CONSTRUCTION - THIS SITE WILL BE OFFICIALLY ANNOUNCED SOON ** | {{{#!wiki caution The Third Answer Set Programming Competition is an '''open''' event: any system based on a declarative problem solving language '''can participate'''. }}} |
| Line 5: | Line 7: |
| Answer Set Programming is a well-established paradigm of declarative programming with close relationship with other declarative modelling paradigms and languages such as SAT Modulo Theories, Constraint Handling Rules, FO(.), PDDL and many others. |
=== Quick directions === |
| Line 10: | Line 9: |
| Since the first informal editions (Dagstuhl 2002 and 2005), ASP systems compete in the nowadays customary ASP Competition: the Third ASP Competition will take place at the University of Calabria (Italy) in the first half of 2011. The event is the sequel to the ASP Competitions Series, held at the Universitaet Potsdam in Germany (2006-2007) and at the University of Leuven in Belgium in 2009. The current competition is held jointly with the 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 11) where the results will be published. |
* [[#schedule|Important Dates]]. * [[CallforParticipation|Call for participation]]. * [[ParticipantSubmission|How to participate]]. |
| Line 19: | Line 13: |
| The formula of the event is open to ASP systems and any other system based on a declarative specification paradigm. |
== News and updates == * Jan 20th, 2010. [[https://www.mat.unical.it/aspcomp2011/ToolsUtilities|Shifter]] tool updated with enable syntax trasformation option (transforms '<>' into '!=', and 'v' into '|')! |
| Line 22: | Line 16: |
| Participant will compete on a selected collection of benchmark problems, declarative specifications and instances thereof. Before the application of competitor systems, there will be a problem selection stage, in which participants and interested researchers will be able to submit problem specifications; these will be then selected by the Organizing Committee, after an informal review and discussion stage. |
* Jan 18th, 2010. You can find in the [[OfficialProblemSuite|Official Problem Suite]] the final problem specifications (continously updated). Stay in touch! |
| Line 29: | Line 18: |
| The Competition will be constituted by two different sub-competitions, conceived for fostering some equivalently important, yet orthogonal, aspects: |
* Jan 10th, 2010. Modified [[http://www.mat.unical.it/aspcomp2011/files/LanguageSpecifications-1.10.pdf|file and language format specifications]]. Please have a look at the change log. * January 5th, 2011. Released a [[PreliminaryProblemList|preliminary problem list]]. You might want to [[https://www.mat.unical.it/aspcomp2011/FrontPage?action=subscribe|subscribe]] this page for getting e-mail notifications about news (needs [[https://www.mat.unical.it/aspcomp2011/FrontPage?action=login|opening]] an user account). |
| Line 32: | Line 24: |
| 1. the System Competition, held on the basis of fixed problem encodings, in a standard ASP language and 2. the Model & Solve Competition, held on an open problem encoding, open language basis, and open to any system based on a declarative specification paradigm. In the former competition the system and its configuration is fixed for all problems; while in the latter the team can choose the best system configuration along with the best encoding for each problem. Given that the interest towards parallel ASP systems is legitimately increasing, we encourage the submission of parallel systems as non-competing participants to both the competition tracks. In order to ensure an high-level of impartiality, the Universita' della Calabria team decided not to participate with an own system. == System Competition == The System Competition is conceived for 1) fostering the introduction of a standard language for ASP, and the birth of a new working group for defining an official standard; 2) let the competitors compare each other in fixed conditions. In this track, problem encodings will be fixed for all participants: specialized solutions on a per problems basis are not allowed. Problems will be specified in the two languages ASP-Core (for most problems) and ASP-RFC. Rankings on the System competition should give a fairly objective measure of what one can expect when switching from a system to another, while keeping all other conditions fixed (problem encoding and default solver settings). === Standard Languages === The large part of the problems will be encoded in ASP-Core, which collects basic ASP features very popular in current systems. A small portion of the problems will be encoded in ASP-RFC to encourage the standardization of other popular basic features. ASP-Core is a conservative extension to the non-ground case of the SCore language adopted in the First ASP Competition; it complies with the core language draft specified at LPNMR 2004, and basically refers to the language specified in the seminal paper Gelfond&Lifschitz 1991; its constructs are nowadays common in current ASP parsers. ASP-Core includes: ground queries, disjunctive rules with negation as failure, strong negation and arithmetic builtins. Terms are constants and variables only. The ASP-RFC format comes in the form of a "Request for Comments" from the ASP community, and extends ASP-Core with non-ground queries, function symbols and a limited number of pre-defined aggregate functions. A limited number of problems specified in ASP-RFC will be selected for the System competition. We do expect the ASP-RFC format will foster discussion in the community and feed useful material to the foreseen forthcoming constitution of an ASP standard language working group. We understand that the semantics of aggregate atoms is currently subject of debate in the community: for the sake of the Competition, ASP-RFC programs are restricted to programs containing non-recursive aggregates where there is a full semantic agreement. Other reasonable restrictions apply for ensuring that integers and function symbols are finitely handled. Usage of full disjunction is circumscribed only to a restricted portion of the selected benchmarks. == Model and Solve Competition == The Model & Solve Competition is conceived for (1) fostering existing relationships with communities neighbor to ASP; (2) encourage the development of new ASP constructs or entirely newly devised declarative programming paradigms; (3) let the partipants compete in an open language, open problem specification regime. In this track, the specification language and the problem encoding are open to the choice of participants. Specialized solutions are allowed: however any submitted solution must be fairly based on a declarative specification system. Rankings on the Model and Solve competition should give a fairly objective measure of what one can expect when a system is adjusted with an encoding of choice and with an evaluation technique of choice for the problem at hand. == Awards == The competition will award a winner for the System Competition and a winner for the Model & Solve competition. Further detail can be found in the Detailed Information section. == Important Dates == * January 4th, 2011 - Deadline for problem submission * January 5-10th, 2011 - Submission of accepted benchmarks in finalized version * February 4th, 2011 - Deadline for Systems submission * February 5-25th, 2011 - Competition stage * May 16th 2011 - Announcement of results and awards at LPNMR 2011 - Vancouver, BC, Canada. == Contacts == * Contact the Organizing Committee [[mailto:aspcomp2011_REPLACE_WITH_AT_mat.unical.it |here]]. |
<<Anchor(detailed)>> |
| Line 125: | Line 28: |
| * [[MSCompetition|Model & Solve Competition]] | |
| Line 126: | Line 30: |
| * [[MSCompetition|Model & Solve Competition]] | |
| Line 129: | Line 32: |
| * [[http://www.mat.unical.it/aspcomp2011/files/LanguageSpecifications.pdf|File and language format specifications]] * [[Benchmark problems classification]] |
* [[http://www.mat.unical.it/aspcomp2011/files/LanguageSpecifications-1.11.pdf|File and language format specifications]] (v. 1.11) * [[http://www.mat.unical.it/aspcomp2011/files/LanguageSpecifications-1.10.pdf|File and language format specifications]] (v. 1.10) * [[http://www.mat.unical.it/aspcomp2011/files/LanguageSpecifications-1.01.pdf|File and language format specifications]] (v. 1.01) * [[http://www.mat.unical.it/aspcomp2011/files/LanguageSpecifications-1.00.pdf|File and language format specifications]] (v. 1.00) * [[BenchmarkProblems|Benchmark problem classification]] |
| Line 136: | Line 42: |
| * [[ToolsUtilities|Tools and Utilities]] * Former competitions: * [[http://asparagus.cs.uni-potsdam.de/contest/|First]] ASP Competition * [[http://dtai.cs.kuleuven.be/events/ASP-competition/index.shtml|Second]] ASP Competition <<Anchor(schedule)>> == Important Dates == * Problem selection stage: * December 31th, 2010 - Deadline for problem submission * January 3th, 2011 - Publication of temporary list of selected benchmarks * January 4-10th, 2011 - Submission of accepted benchmarks in finalized version * January 10th, 2011 - Publication of the final list of selected problems {{{#!wiki caution * <<newicon>> Competition stage schedule: * February 4th, 2011 - '''Dry Run start'''. Systems which are already submitted and set up by that date will be automatically tested on official instances. Any problem on the dry run will be privately reported to competitors. Note that competitors submissions '''will be not closed''' until the final deadline: systems not submitted within this deadline will simply not undergo the dry run. * February 13th, 2011, 23:59 Pacific Standard Time - '''Final''' deadline for Competitors Submission. * February 14th, 2011 - Start of the unmanned official competition run. * May 16th 2011 - Announcement of results and awards at [[https://sites.google.com/site/lpnmr11/ |LPNMR 2011]] - Vancouver, BC, Canada. }}} == Contacts == * [[OrganizingCommittee|Organizing Committee]] * Contact the Organizing Committee [[mailto:aspcomp2011_REPLACE_WITH_AT_mat.unical.it |here]]. |
Third Answer Set Programming Competition - 2011
The Third Answer Set Programming Competition is an open event: any system based on a declarative problem solving language can participate.
Quick directions
News and updates
Jan 20th, 2010. Shifter tool updated with enable syntax trasformation option (transforms '<>' into '!=', and 'v' into '|')!
Jan 18th, 2010. You can find in the Official Problem Suite the final problem specifications (continously updated). Stay in touch!
Jan 10th, 2010. Modified file and language format specifications. Please have a look at the change log.
January 5th, 2011. Released a preliminary problem list.
You might want to subscribe this page for getting e-mail notifications about news (needs opening an user account).
Detailed Information
- Competition Categories
- Former competitions:
Important Dates
- Problem selection stage:
- December 31th, 2010 - Deadline for problem submission
- January 3th, 2011 - Publication of temporary list of selected benchmarks
- January 4-10th, 2011 - Submission of accepted benchmarks in finalized version
- January 10th, 2011 - Publication of the final list of selected problems
Competition stage schedule: February 4th, 2011 - Dry Run start. Systems which are already submitted and set up by that date will be automatically tested on official instances. Any problem on the dry run will be privately reported to competitors. Note that competitors submissions will be not closed until the final deadline: systems not submitted within this deadline will simply not undergo the dry run.
February 13th, 2011, 23:59 Pacific Standard Time - Final deadline for Competitors Submission.
- February 14th, 2011 - Start of the unmanned official competition run.
May 16th 2011 - Announcement of results and awards at LPNMR 2011 - Vancouver, BC, Canada.
Contacts
Contact the Organizing Committee here.