1 citations · 1 across the 2 of their papers we have counts for
4 papers
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…
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…
Evidence for Long-Tails in SLS Algorithms
Florian Wörz, Jan-Hendrik Lorenz
Stochastic local search (SLS) is a successful paradigm for solving the satisfiability problem of propositional logic. A recent development in this area involves solving not the ori…
On the Effect of Learned Clauses on Stochastic Local Search
Jan-Hendrik Lorenz, Florian Wörz
There are two competing paradigms in successful SAT solvers: Conflict-driven clause learning (CDCL) and stochastic local search (SLS). CDCL uses systematic exploration of the searc…