Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers

@inproceedings{Elffers2018UsingCB,
  title={Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers},
  author={Jan Elffers and Jes{\'u}s Gir{\'a}ldez-Cru and Jakob Nordstr{\"o}m and Marc Vinyals},
  booktitle={SAT},
  year={2018}
}
We study cdcl-cuttingplanes, Open-WBO, and Sat4j, three successful solvers from the Pseudo-Boolean Competition 2016, and evaluate them by performing experiments on crafted benchmarks designed to be trivial for the cutting planes (CP) proof system underlying pseudo-Boolean (PB) proof search but yet potentially tricky for PB solvers. Our experiments demonstrate severe shortcomings in state-of-the-art PB solving techniques. Although our benchmarks have linear-size tree-like CP proofs, and are thus… CONTINUE READING

Topics from this paper.