Jan Elffers

E-mail: elffers@kth.se

I am a PhD student in the Theoretical Computer Science group at KTH Royal Institute of Technology. I work on SAT solving, within the Proof complexity and SAT solving project supervised by prof. Jakob Nordström.


Pseudo-boolean SAT solver

RoundingSat is a pseudo-boolean solver that participated in the pseudo-boolean evaluation (2015, 2016; here it was named "cdcl-cuttingplanes").

The Linux 64-bit binary (statically built) of the latest version can be downloaded here.

RoundingSat is copyrighted 2014-2018 by Jan Elffers. All rights reserved.

RoundingSat is available for research and evaluation purposes only and not for commercial use. RoundingSat is provided as is, without any warranty.