Pseudo-Boolean Competition 2012
The 2012 pseudo-Boolean competition is organized as a special
event of the SAT
Like the previous evaluations and competitions(PB05,
PB07, PB09, PB10, PB11), the goal is to
assess the state of the art in the field of pseudo-Boolean solvers.
This edition of the competition will be very similar to the PB11
competition (no new problem introduced). We especially encourage the submission
of new solvers and new instances.
This is the last PB competition organized by V. Manquinho and
O. Roussel. Anyone interested in organizing the future PB competitions
can get in touch with the organizers.
For questions, comments and any other issue regarding the PB
competition, please get in touch with firstname.lastname@example.org.
Results of the competition
The timetable of the 2012 evaluation is detailed below.
||March 5, 2012
request a login on the registration
|March 19, 2012
April 13, 2012
benchmarks submission deadline
|March 26, 2012
April 20, 2012
| Solvers description
must be provided by
||May 14, 2012
| Results will be
given during the SAT 2012
||June 17-June 20, 2012
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.
All the details about the input format, the
output of the solver and its running environment are available in this PDF file.
Sample code, parsers for a few languages and a
few programming tips are also available.
Benchmarks to test your solvers (as well as the results of the
competitions) are available from
the PB11 site
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 must publish on
March 19, 2012 April 2, 2012
either a precise description of their solver, or the source code,
or the binary of their solver, or a fingerprint of one of these.
Here are the fingerprints of the submitted solvers:
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
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).
- 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
Benchmarks submitters may provide a description of their benchmarks set
to be made available on the evaluation web site.
of the previous competitions can be downloaded from the PB11 site.
To reach the organizers, send an email to email@example.com.
INESC-ID, Lisboa, Portugal
vmm at sat.inesc.pt / home page
CRIL, Université d'Artois, France
cril.univ-artois.fr / home page