Pseudo-Boolean Competition 2010

The 2010 pseudo-Boolean competition is organized as a special
event of the SAT
2010
conference.
Like the previous evaluations and competitions(PB05,
PB06,
PB07, PB09), the goal is to
assess the state of the art in the field of pseudo-Boolean solvers.

Judges

As last year, two judges are in charge of taking the decisions that
couldn't or shouldn't be taken by the organizers.
The organizers are greatly indebted to Heidi Dixon (author of
the pbChaff solver) and Peter Barth (author of the opbdp solver) who
have accepted this task.

Call for solvers

We encourage the submission of any kind of pseudo-Boolean solver
(complete or incomplete solvers, working on linear or non-linear
constraints, etc.). There are a few simple requirements to ensure
that a submitted solver will correctly operate in the evaluation
environment. It is expected that any pseudo-Boolean solver can be
easily modified to conform to these requirements. People interested in
submitting a solver can contact the organizers to get some help.

Benchmarks to test your solvers (as well as the results of the
competitions) are available from
the PB07
and PB09 sites

Some test instances are available for the new WBO format. They were
artificially generated by adding a cost to the constraints of
pigeon-hole instances. Instances were generated with 0%, and
approximately 25%, 50% and 75% of hard constraints (directories soft,
partial25, partial50 and partial75 respectively). Other instances were
generated with a top cost set to 50 (directories *-topcost).
You can download the archive with all these instances: wbo-examples.tar.bz2.

Solver submitters implicitly accept that the results of their solver be
publicly available on the evaluation web site.
Solver submitters are strongly encouraged to make their solver publicly
available, either in source code or in executable format. However, this
is not a requirement for entering the evaluation.

Solvers submitted by the organizers

Organizers may submit their solvers but the submitted
solvers must be publicly available (either in source code or in
executable
format) on May 23, 2010.

Call for benchmarks

Benchmarks may be submitted in any reasonable format. The organizers
will do their best to translate the submitted benchmarks to the input
format adopted for the evaluation. A benchmark submitted in the format
of the evaluation will still be normalized to ensure consistency among
all the input files.

We would particularly appreciate the submission of

industrial benchmarks

benchmarks generators (written in any reasonable language)

benchmarks set with a wide distribution of their number of
clauses, cardinality constraints and pseudo-Boolean constraints

benchmarks with non-linear constraints

Submitted benchmarks will be made available on the evaluation web site
shortly after the beginning of the evaluation. We cannot accept
benchmarks which are not publicly available (because anyone must be
able to reproduce the experiments of the evaluation).

Benchmarks submitters may provide a description of their benchmarks set
to be made available on the evaluation web site.