Jan Elffers

11 papers A* 4A 5B 1Journal 1
YearRankTypeTitle / Venue / Authors
2020 A* conf
A Cardinal Improvement to Pseudo-Boolean Solving.
AAAI
Jan Elffers, Jakob Nordström
2020 A* conf
Justifying All Differences Using Pseudo-Boolean Reasoning.
AAAI
Jan Elffers, Stephan Gocht, Ciaran McCreesh, Jakob Nordström
2020 A conf
Simplified and Improved Separations Between Regular and General Resolution by Lifting.
SAT
Marc Vinyals, Jan Elffers, Jan Johannsen, Jakob Nordström
2020 B conf
Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning.
FMCAD
Vincent Liew, Paul Beame, Jo Devriendt, Jan Elffers, Jakob Nordström
2018 A* conf
Divide and Conquer: Towards Faster Pseudo-Boolean Solving.
IJCAI
Jan Elffers, Jakob Nordström
2018 A conf
In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving.
SAT
Marc Vinyals, Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström
2018 A* conf
Seeking Practical CDCL Insights from Theoretical SAT Benchmarks.
IJCAI
Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström, Laurent Simon
2018 A conf
Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers.
SAT
Jan Elffers, Jesús Giráldez-Cru, Jakob Nordström, Marc Vinyals
2017 A conf
CNFgen: A Generator of Crafted Benchmarks.
SAT
Massimo Lauria, Jan Elffers, Jakob Nordström, Marc Vinyals
2016 A conf
Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers.
SAT
Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordström, Marc Vinyals
2014 J jnl
Scheduling with two non-unit task lengths is NP-complete.
CoRR
Jan Elffers, Mathijs de Weerdt