8 citations · 12 across the 5 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022
Towards an Understanding of Long-Tailed Runtimes of SLS Algorithms
Jan-Hendrik Lorenz, Florian Wörz
The satisfiability problem is one of the most famous problems in computer science. Its NP-completeness has been used to argue that SAT is intractable. However, there have been trem…
cs.AI2022★ 1 cited
Too much information: why CDCL solvers need to forget learned clauses
Tom Krüger, Jan-Hendrik Lorenz, Florian Wörz
Conflict-driven clause learning (CDCL) is a remarkably successful paradigm for solving the satisfiability problem of propositional logic. Instead of a simple depth-first backtracki…