Jan Elffers

Publication Activity (10 Years)

Years Active: 2014-2020
Publications (10 Years): 10

Top Topics

Combinatorial Problems

Propositional Satisfiability

Top Venues

Publications

Vincent Liew, Paul Beame, Jo Devriendt, Jan Elffers, Jakob Nordström
Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning. FMCAD (2020)
Marc Vinyals, Jan Elffers, Jan Johannsen, Jakob Nordström
Simplified and Improved Separations Between Regular and General Resolution by Lifting. SAT (2020)
Jan Elffers, Jakob Nordström
A Cardinal Improvement to Pseudo-Boolean Solving. AAAI (2020)
Jan Elffers, Stephan Gocht, Ciaran McCreesh, Jakob Nordström
Justifying All Differences Using Pseudo-Boolean Reasoning. AAAI (2020)
Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström, Laurent Simon
Seeking Practical CDCL Insights from Theoretical SAT Benchmarks. IJCAI (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)
Jan Elffers, Jakob Nordström
Divide and Conquer: Towards Faster Pseudo-Boolean Solving. IJCAI (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)
Jan Elffers, Mathijs de Weerdt
Scheduling with two non-unit task lengths is NP-complete. CoRR (2014)