Basic Benchmark Problems:

• All problem instances should be encoded in a format understandable by one of the installed solvers (See Solvers section). The (disjunctive) datalog-like format of DLV with constraints, true negation, plus the standard built in and arithmetic predicates is preferred. They should come in 1+N files (either general or the first instance file might be an empty file but must be present)
     general-<benchmark name>.lp
   instance-<benchmark name>-N.lp
  If you have the benchmarks in formats for more than one solvers please submit them as separate submissions.

• The benchamrk files should be packaged into .tar.gz files. If you think it makes sense to divide the set of instances you are submitting into several packages which should be distributed separately, bundle them as you see fit.

• You should provide information on the instances, at least the number of ground and non-ground rules, and some background on the problem class. For examples, see the descriptions in the benchmarks section of ASPLIB. The description you send should ideally be an HTML document. PDF files are also OK, if no HTML version is available. Please do not send research papers instead of the problem description, unless the description of the benchmark problems is the prime topic of the paper.

Advanced Benchmark Problems:

• We have so far no good suggestion for a format of weights, constraints, symbolic sets and so on. Your suggestions are welcomed.