Who can Participate?

The competition is open to any kind of solver, not only for ASP-systems but also for SAT and CP-systems or any other sort of solvers (e.g. pseudo-Boolean solvers).

This is a Model and Solve competition, which means that a team needs to develop modelings for all benchmarks. This can be a burden, in particular for small teams. There are several useful tools for help.

The Pottasco-team (University of Potsdam) makes available all its benchmark solutions, written for clasp and gringo on the new asparagus webpage. Look here for more details.

For SAT-teams there are several tools available that could be used to create SAT-encodings from high level modelings and instances of benchmark problems.

• Several front-ends take classical first order logic as input and ground to standard CNF in DIMACS format:
  
  • Kodkod http://alloy.mit.edu/kodkod/ by Emina Torlak.
  • cnfGidL http://cs.kuleuven.be/~dtai/events/ASP-competition/cnfGidL/cnfGidL.tgz by Johan Wittocx.
• The system psgrnd http://www.cs.uky.edu/ai/aspps/ by Mikitiuk, Iakhiaev and Truszczynski takes "the language of propositional schemata" as input and, when called with the mode -DIMACS, grounds it to CNF in DIMACS format.
• From http://www.cs.bgu.ac.il/~mcodish/Software/pl-minisat.tgz a Prolog-to-SAT interface built by Mike Codish can be obtained.
• The ASP-solver pbmodels http://www.cs.uky.edu/ai/pbmodels/ by Lengning Liu and Miroslaw Truszczynski works by grounding an ASP program to a CNF theory in DIMACS format.