Preprocessing techniques are crucial for SAT solvers when it comes to reaching state-of-the-art performance as it was shown by the results of the last SAT Competitions. The usefulness of a prepro-cessing technique depends highly on its own parameters, on the instances on which it is applied and on the used solver. In this paper we first give an extended analysis of the performance gain reached by using different preprocessing techniques individually in combination with CDCL solvers on application instances and SLS solvers on crafted instances. Further, we provide an analysis of combinations of preprocessing techniques by means of automated algorithm configuration, where we search for optimal preprocessor configurations for different scenari...
Over the last decades Boolean satisfiability (SAT) solvers based on conflict-driven clause learning ...
The past few years have seen an enormous progress in the performance of Boolean satisfiability (SAT)...
Abstract. We present an improvement to the Hypre preprocessing algorithm that was suggested by Bacch...
Abstract. State of the art Stochastic Local Search (SLS) solvers have difficulty in solving many CNF...
Applying pre- and inprocessing techniques to simplify CNF formulas both before and during search can...
The paper presents our work on cache analysis of SAT-solving. The aim is to study how resources are ...
Boolean structural measures were introduced to explain the high performance of conflict-driven claus...
High-performance SAT solvers based on systematic search generally use either conflict driven clause ...
We introduce Intel(R) SAT Solver (IntelSAT) - a new open-source CDCL SAT solver, written from scratc...
Data for the article Janne I. Kokkala, Jakob Nordström: Using Resolution Proofs to Analyse CDCL SAT ...
Abstract. SAT solvers are often challenged with very hard problems that remain unsolved after hours ...
Abstract. So-called Modern SAT solvers are built upon a few – but essential – ingredients: branching...
Abstract. Stochastic Local Search (SLS) solvers are considered one of the best solving technique for...
We propose that CDCL SAT solver heuristics such as restarts and clause database management can be an...
The performance of many hard combinatorial problem solvers depends strongly on their parameter setti...
Over the last decades Boolean satisfiability (SAT) solvers based on conflict-driven clause learning ...
The past few years have seen an enormous progress in the performance of Boolean satisfiability (SAT)...
Abstract. We present an improvement to the Hypre preprocessing algorithm that was suggested by Bacch...
Abstract. State of the art Stochastic Local Search (SLS) solvers have difficulty in solving many CNF...
Applying pre- and inprocessing techniques to simplify CNF formulas both before and during search can...
The paper presents our work on cache analysis of SAT-solving. The aim is to study how resources are ...
Boolean structural measures were introduced to explain the high performance of conflict-driven claus...
High-performance SAT solvers based on systematic search generally use either conflict driven clause ...
We introduce Intel(R) SAT Solver (IntelSAT) - a new open-source CDCL SAT solver, written from scratc...
Data for the article Janne I. Kokkala, Jakob Nordström: Using Resolution Proofs to Analyse CDCL SAT ...
Abstract. SAT solvers are often challenged with very hard problems that remain unsolved after hours ...
Abstract. So-called Modern SAT solvers are built upon a few – but essential – ingredients: branching...
Abstract. Stochastic Local Search (SLS) solvers are considered one of the best solving technique for...
We propose that CDCL SAT solver heuristics such as restarts and clause database management can be an...
The performance of many hard combinatorial problem solvers depends strongly on their parameter setti...
Over the last decades Boolean satisfiability (SAT) solvers based on conflict-driven clause learning ...
The past few years have seen an enormous progress in the performance of Boolean satisfiability (SAT)...
Abstract. We present an improvement to the Hypre preprocessing algorithm that was suggested by Bacch...