|
Size: 6260
Comment:
|
Size: 7007
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 5: | Line 5: |
| 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. |
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. |
| Line 9: | Line 10: |
| 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 ([[https://sites.google.com/site/lpnmr11/|LPNMR 11]]) where the results will be published. |
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. |
| Line 15: | Line 19: |
| The formula of the event is open to ASP systems and any other system based on a declarative specification paradigm. 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. |
The formula of the event is open to ASP systems and any other system based on a declarative specification paradigm. |
| Line 18: | Line 22: |
| The Competition will be constituted by two different sub-competitions, conceived for fostering some equivalently important, yet orthogonal, aspects: the System Competition, held on the basis of a fixed problem specification, fixed standard ASP language, and the Model & Solve Competition, held on an open problem specification, open language basis, and open to any system based on a declarative specification paradigm. 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. |
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. |
| Line 26: | Line 29: |
| In order to ensure an high-level of impartiality, the Universita' della Calabria team decided not to participate with an own system. | The Competition will be constituted by two different sub-competitions, conceived for fostering some equivalently important, yet orthogonal, aspects: 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. |
| Line 30: | Line 51: |
| 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. |
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. |
| Line 34: | Line 56: |
| 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 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). |
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). |
| Line 44: | Line 65: |
| 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 includes constructs which 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 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. |
| Line 50: | Line 70: |
| 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. |
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. |
| Line 56: | Line 79: |
| 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. Other reasonable restriction apply for ensuring that integers and function symbols are finitely handled. |
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. |
| Line 61: | Line 87: |
| 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. |
|
| Line 64: | Line 97: |
| The Model & Solve Competition is conceived for | The Model & Solve Competition is conceived for |
| Line 66: | Line 99: |
| (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. |
(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. |
| Line 69: | Line 102: |
| In this track, the specification language and the problem encoding are open to the choice of participants. Specialized solutions are allowed: 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. |
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. |
| Line 77: | Line 107: |
| The competition will award a winner for the System Competition and a winner for the Model & Solve competition. | The competition will award a winner for the System Competition and a winner for the Model & Solve competition. |
| Line 79: | Line 110: |
| Further detail can be found in the Detailed Information section. |
Third Answer Set Programming Competition - 2011
** UNDER CONSTRUCTION - THIS SITE WILL BE OFFICIALLY ANNOUNCED SOON **
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.
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.
The formula of the event is open to ASP systems and any other system based on a declarative specification paradigm.
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.
The Competition will be constituted by two different sub-competitions, conceived for fostering some equivalently important, yet orthogonal, aspects:
- the System Competition, held on the basis of fixed problem encodings,
in a standard ASP language and
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 here.