Pseudo-Boolean Evaluation 2006: Available Documents

This page puts together some documents about the 2006 pseudo-Boolean evaluation.

Results of the evaluation

Slides of the presentation of the results at SAT 2006, Seattle WA (August 15, 2006)

Solver descriptions

  1. absconPseudo
    Fred Hemery & Christophe Lecoutre
    supports SMALLINT and MEDINT in both SATUNSAT and OPT categories
    description (local document)
  2. bsolo (web page)
    J. Marques-Silva & V. Manquinho
    supports SMALLINT, MEDINT and BIGINT in both SATUNSAT and OPT categories
    Paper (remote document) from the Journal on Satisfiability, Boolean Modeling and Computation, volume 2
  3. glpPB (web page)
    Hossein Sheini & K. Sakallah
    supports SMALLINT and MEDINT in both SATUNSAT and OPT categories
    description (local document)
  4. minisat+ (web page)
    Niklas Eén & Niklas Sörensson
    supports SMALLINT, MEDINT and BIGINT in both SATUNSAT and OPT categories
    Paper (remote document) from the Journal on Satisfiability, Boolean Modeling and Computation, volume 2
  5. PB-smodels (web page)
    Gayathri Namasivayam
    supports SMALLINT in both SATUNSAT and OPT categories
    description (local document)
  6. PBS (web page)
    Bashar Al Rawi & Fadi Aloul
    supports SMALLINT and MEDINT in both SATUNSAT and OPT categories
    F. Aloul, A. Ramani, I. Markov, and K. Sakallah, "Generic ILP versus Specialized 0-1 ILP: an Update" International Conference on Computer Aided Design (ICCAD), 450-457, 2002.
  7. Pueblo (web page)
    Hossein Sheini & K. Sakallah
    supports SMALLINT and MEDINT in both SATUNSAT and OPT categories
    description of version 1.5 (local document)
    Paper (remote document) from the Journal on Satisfiability, Boolean Modeling and Computation, volume 2
  8. SAT4JPSEUDO (web page)
    Daniel Le Berre & Anne Parrain
    supports SMALLINT, MEDINT and BIGINT in both SATUNSAT and OPT categories
    description (local document)
  9. wildcat (web page)
    Lengning Liu & Miroslaw Truszczynski
    supports SMALLINT in both SATUNSAT and OPT categories
    description (local document)

Benchmark descriptions

  1. Degree bounded spanning tree instances (L. Liu, G. Namasivayam and M. Truszczynski)
  2. Weighted N-Queens (L. Liu, G. Namasivayam and M. Truszczynski)
  3. Travelling Salesperson Problem (G. Namasivayam, L. Liu and M. Truszczynski)
  4. Weighted N-queens (G. Namasivayam, L. Liu and M. Truszczynski)