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.
- Jan Elffers, Jakob Nordström:
Divide and Conquer: Towards Faster Pseudo-Boolean Solving. IJCAI-ECAI 2018
- Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström, Laurent Simon:
Seeking Practical CDCL Insights from Theoretical SAT Benchmarks. IJCAI-ECAI 2018
- Jan Elffers, Jesús Giráldez-Cru, Jakob Nordström, Marc Vinyals:
Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers. SAT 2018
- Marc Vinyals, Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström:
In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving. SAT 2018
- Massimo Lauria, Jan Elffers, Jakob Nordström, Marc Vinyals:
CNFgen: a Generator of Crafted Benchmarks. SAT 2017
- Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordström, Marc Vinyals:
Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers. SAT 2016
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.