Jan Elffers

According to our database, Jan Elffers authored at least 11 papers between 2014 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Simplified and Improved Separations Between Regular and General Resolution by Lifting.

Marc Vinyals, Jan Elffers, Jan Johannsen, Jakob Nordström

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning.

Vincent Liew, Paul Beame, Jo Devriendt, Jan Elffers, Jakob Nordström

Proceedings of the 2020 Formal Methods in Computer Aided Design, 2020

A Cardinal Improvement to Pseudo-Boolean Solving.

Jan Elffers, Jakob Nordström

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Justifying All Differences Using Pseudo-Boolean Reasoning.

Jan Elffers, Stephan Gocht, Ciaran McCreesh, Jakob Nordström

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2018

In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving.

Marc Vinyals, Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

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

Jan Elffers, Jesús Giráldez-Cru, Jakob Nordström, Marc Vinyals

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

Divide and Conquer: Towards Faster Pseudo-Boolean Solving.

Jan Elffers, Jakob Nordström

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Seeking Practical CDCL Insights from Theoretical SAT Benchmarks.

Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström, Laurent Simon

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017

CNFgen: A Generator of Crafted Benchmarks.

Massimo Lauria, Jan Elffers, Jakob Nordström, Marc Vinyals

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

2016

Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers.

Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordström, Marc Vinyals

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

2014

Scheduling with two non-unit task lengths is NP-complete.

Jan Elffers, Mathijs de Weerdt

CoRR, 2014