SAT solvers
Tuning Parallel SAT Solvers
... Parallel SAT solving is challenging, but some of these challenges can be tackled by a well-designed parallel SAT ...better solvers are available, they will not only be used to solve the same problems ...
17
Efficient data structures for backtrack search SAT solvers
... state-of-the-art SAT solvers currently utilize lazy data ...search SAT solvers that solely utilize Boolean Constraint Propagation, the laziness of these data structures may pose some problems, ...
16
A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples
... using SAT solvers coupled with com- puter algebra systems and mathematical libraries is a practi- cal method of enumerating circulant good matrices (at least those with orders divisible by ...
8
The Effect of Nogood Recording in DPLL CBJ SAT Algorithms
... (SAT) solvers have been the sub- ject of remarkable improvements in the last few ...successful SAT solvers share a number of similarities, being based on backtrack search, applying unit ...
15
Breaking Symmetries in SAT Matrix Models
... of SAT solvers learning techniques, modelling has not been much developed in SAT, at least when com- pared with other areas such as ...the SAT solver learn intelligently rather than telling in ...
6
SAT-Based Explicit LTLf Satisfiability Checking
... sequence, which is similar to the state-of-art model check- ing technique IC3 (Bradley 2011). CDLSC does not require the conflict sequence to be monotone, and simply use the UC from SAT solvers to update ...
8
Improving the efficiency of learning CSP solvers
... and SAT, this work adds huge value compared to a simple statement that “lazy explanations have been shown to work in SMT” or “forgetting is a ubiquitous technique in SAT solvers”, for ...
187
Evaluating CDCL Restart Schemes
... the SAT competition [5] has not been analyzed ...of SAT solvers, it is not clear whether evaluations, such as done in [15], still apply to current state-of-the-art ...that solvers with fixed ...
17
SAT-encodings for treecut width and treedepth
... art SAT solvers. The success of SAT-based decomposition methods crucially depends on the used characterisation of the decomposition method, as not every characterisation is suitable for that ...
13
Heuristic Backtracking Algorithms for SAT
... search SAT solvers have been the subject of dramatic ...allowed SAT solvers to successfully replace BDDs in many areas of formal verification, and also motivated the devel- opment of many new ...
6
Searching a multivariate partition space using weighted MAX SAT
... MAX- SAT methodology over many greedy search algorithms such as agglomerative hierarchical clustering (AHC) is that they are not intrinsically ...MAX-SAT solvers gen- ...
9
The Effect of Scrambling CNFs
... how SAT solvers and in general different or new algorithms should be evaluated and compared both in competitions and more importantly in ...two SAT competitions and solved them with the best ...
16
2012 ACORN-SAT paper
... Potential inhomogenities in the ACORN-SAT data set were detected using a combination of metadata and sta- tistical methods. The use of metadata is preferable if it is available, since it can demonstrate ...
20
Structural Aspects of Propositional SAT
... Proof. It suffices to prove that the set M ( C ) of mod- els of C is in 1:1-correspondence to the set M ( C X ) of models of C X . Since this particularly implies C ∈ SAT ⇔ M ( C ) = ∅ ⇔ M ( C X ) = ∅ ⇔ C X ∈ ...
6
Krylov Subspace Solvers and Preconditioners
... At the end of the lecture notes many references are given to state of the art Scientific Computing methods. Here, we will discuss a number of books which are nice to use for an overview of background material. First of ...
43
A pearl on SAT solving in Prolog
... The solver is called with two arguments. The first represents a formula in CNF as a list of lists, each constituent list representing a clause. The literals of a clause are represented as pairs, Pol-Var, where Var is a ...
11
Effect of soil saturation on denitrification in a grassland soil
... Figure 5. Site preference (‰) vs. δ 18 O (‰) in all treatments for three periods (day −1, days 1–2 and days 3–12) in the experiment: (a) SAT/sat treatment; (b) HALFSAT/sat; (c) UNSAT/sat; (d) ...
21
A pearl on SAT and SMT solving in Prolog
... external SAT solver coded in C can be integrated with Prolog [5] and this has been utilised for a number of ...a SAT solver, either for use in a stand-alone fashion or in tandem with a constraint ...a ...
18
Backdoors into heterogeneous classes of SAT and CSP
... In this work, we provide two significant extensions to the exciting research on fixed-parameter tractable backdoor set detection. First, we introduce heterogeneous base classes, which can be composed of several homogeneous ...
20
Recent advances in sparse direct solvers
... Large sparse linear systems appear in numerous scientific applications. For example, the structural analysis of nuclear plants after the Fukushima events (March 2011) requires to solve large linear systems with typically ...
10