Post Mortem Analysis of SAT Solver Proofs

@inproceedings{Simon2014PostMA,
  title={Post Mortem Analysis of SAT Solver Proofs},
  author={Laurent Simon},
  booktitle={POS@SAT},
  year={2014}
}
Conflict-Driven Clause Learning algorithms are well known from an engineer point of view. Thanks to Minisat, their designs are well understood, and most of their implementations follow the same ideas, with essentially the same components. Same heuristics, fast restarts, same learning mechanism. However, their efficiency has an important drawback: they are more and more like complex systems and harder and harder to handle. Unfortunately, only a few works are focusing on understanding them rather… Expand
On the Non-degeneracy of Unsatisfiability Proof Graphs Produced by SAT Solvers
TLDR
It is demonstrated that the analysis of the dependency graph is possible with a reasonable cost in any CDCL, and it is shown that the existence of large K-Cores, even on parallelized SAT solvers with clauses exchanges, is unveiled. Expand
Beyond the structure of SAT formulas
TLDR
This dissertation extends the understandings of the structure of SAT instances, with the aim of better explaining the success of CDCL techniques and possibly improve them, and proposes a number of applications based on this analysis of the underlyingructure of SAT formulas. Expand
Using Resolution Proofs to Analyse CDCL SAT solvers
We propose that CDCL SAT solver heuristics such as restarts and clause database management can be analysed by studying the resolution proofs produced by the solvers, and by trimming these proofs toExpand
Between SAT and UNSAT: The Fundamental Difference in CDCL SAT
TLDR
This paper identifies direct connections to the workings of some of the most important elements in CDCL solvers: the effects of restarts and VSIDS, and the roles of learned clauses, and gives a wide range of concrete evidence that highlights the varying effects and roles of these elements. Expand
Improving SAT Solvers by Exploiting Empirical Characteristics of CDCL
TLDR
This thesis provides an unconventional perspective that CDCL solvers can solve real-world problems very efficiently and often more efficiently just by maintaining a small set of certain classes of learned clauses. Expand
of Pragmatics of SAT 2015 and 2018 Checking Unsatisfiability Proofs in Parallel
Contemporary SAT solvers emit unsatisfiability proofs in the DRAT format to increase confidence in their answers. The state-of-the-art proof verifier drat-trim uses backwardchecking and deletionExpand
SAT and CP - Parallelisation and Applications
TLDR
This thesis considers the parallelisation and application of SAT and CP solvers, and considers the question how many parallel sorting steps are needed to sort some inputs, and presents both lower and upper bounds for several cases. Expand
Community Structure in Industrial SAT Instances
TLDR
In this paper, inspired by the results on complex networks, the community structure, or modularity, of industrial SAT instances is studied and how this structure evolves by the effects of the execution of a CDCL SAT solver is analyzed. Expand
Using Community Structure to Detect Relevant Learnt Clauses
TLDR
Nowadays, Conflict-Driven Clause Learning techniques are one of the key components of modern SAT solvers specialized in industrial instances and it has been shown that more aggressive clause deletion policies may improve solvers performance, even when memory is sufficient. Expand
A I ] 3 J ul 2 01 6 Community Structure in Industrial SAT Instances
Modern SAT solvers have experienced a remarkable progress on solving industrial instances. Most of the techniques have been developed after an intensive experimental process. It is believed thatExpand
...
1
2
...

References

SHOWING 1-10 OF 15 REFERENCES
The Effect of Restarts on the Efficiency of Clause Learning
TLDR
There is strong evidence that a clause learning SAT solver could benefit substantially from a carefully designed restart policy (which may not yet be available), and motivation for the design of better restart policies, particularly dynamic ones. Expand
Predicting Learnt Clauses Quality in Modern SAT Solvers
TLDR
A key observation of CDCL solvers behavior on this family of benchmarks is reported and an unsuspected side effect of their particular Clause Learning scheme is explained, allowing this work to solve an important, still open, question: How to designing a fast, static, accurate, and predictive measure of new learnt clauses pertinence. Expand
Relating Proof Complexity Measures and Practical Hardness of SAT
TLDR
A systematic study of the interconnections between theoretical complexity and practical SAT solver performance and concludes that the resolution space complexity of a formula would seem to be a more fine-grained indicator of whether the formula is hard or easy than the length or width needed in a resolution proof. Expand
Resolution and Parallelizability: Barriers to the Efficient Parallelization of SAT Solvers
TLDR
It is suggested that efficient parallelization of SAT solvers is not simply a matter of designing the right clause sharing heuristics; even in the best case, it can be -- and indeed is -- hindered by the structure of the resolution proofs current SATsolvers typically produce. Expand
Measuring the Hardness of SAT Instances
TLDR
The use of the tree-like space complexity as a solid candidate to be the best measure for solvers based on DPLL is proposed and a comparison with the other mentioned measures is provided. Expand
An Extensible SAT-solver
TLDR
This article presents a small, complete, and efficient SAT-solver in the style of conflict-driven learning, as exemplified by Chaff, and includes among other things a mechanism for adding arbitrary boolean constraints. Expand
On the limit of branching rules for hard random unsatisfiable 3-SAT
TLDR
The experimental results suggest that the branching rules used in the current state-of-the-art DP procedures are already close to the optimal for hard random unsatisfiable 3-SAT, and that the first of the ten challenges for propositional reasoning and search formulated by Selman et al. in [14] probably cannot be answered by DP procedure unless something significantly different from branching can be made effective. Expand
On Computing Minimal Equivalent Subformulas
TLDR
A new class of algorithms that are based on the iterative analysis of subsets of clauses that can be adapted to the computation of MESes, and the experimental results confirm the effectiveness of the proposed algorithms. Expand
Community-Based Partitioning for MaxSAT Solving
TLDR
A new technique is proposed to partition the MaxSAT formula in order to identify smaller unsatisfiable subformulas at each call of the SAT solver, and is shown to significantly improve the unsatisfiability-based algorithm for different benchmark sets. Expand
Effective Preprocessing in SAT Through Variable and Clause Elimination
TLDR
This work combines variable elimination with subsumption and self-subsuming resolution, and shows that these techniques not only shrink the formula further than previous preprocessing efforts based on variable elimination, but also decrease runtime of SAT solvers substantially for typical industrial SAT problems. Expand
...
1
2
...