Theory and Applications of Satisfiability Testing

@inproceedings{Giunchiglia2003TheoryAA,
  title={Theory and Applications of Satisfiability Testing},
  author={Enrico Giunchiglia and Armando Tacchella},
  booktitle={Lecture Notes in Computer Science},
  year={2003}
}
ion-Driven SAT-based Analysis of Security Protocols . . . . . . . . . . 257 Alessandro Armando, Luca Compagna A Case for Efficient Solution Enumeration . . . . . . . . . . . . . . . . . . . . . . . . . . . 272 Sarfraz Khurshid, Darko Marinov, Ilya Shlyakhter, Daniel Jackson Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 287 Lintao Zhang, Sharad Malik Local Consistencies in SAT… 
View on Springer
wikidata.org
151 Citations
Highly Influential Citations
8
Background Citations
29
Methods Citations
28

151 Citations

Citation Type

Citation Type

Framework for Generating Configurable SAT Solvers
TLDR
A comparison among the state-of-theart SAT solvers is presented by using a benchmark with several CEC instances derived from their circuit generation tool, and it is stated that BerkMin was the most suitable SAT solver for the selected benchmark providing the best solving times.
Efficient and Trustworthy Theory Solver for Bit-vectors in SatisfiabilityModulo Theories
TLDR
This thesis proposes a proof system for encoding automatically checkable refutation proofs in the theory of bit-vectors, which can be automatically generated by the SMT solver, and act as a certificate for the correctness of the result.
An effective probability distribution SAT solver on reconfigurable hardware
TLDR
A hardware implementation of the probSAT algorithm using High-Level Synthesis (HLS) for rapid porting of the design from the original C implementation shows very strong performance on the class of small, but difficult SAT problems with speedups between 89–828x over MiniSAT and 5–99x over the software implementation of probSat on such problems.
Backdoor Sets for DLL Subsolvers
TLDR
It is shown that the detection of backdoor sets of size bounded by a fixed integer k is of high parameterized complexity, and that this detection problem (and some of its variants) is complete for the parameterization complexity class W[P].
TR-2007008: The Satisfiability Problem—From the Theory of NP-Completeness to State-of-the-Art SAT Solvers
TLDR
SAT is introduced through the theory of NP-completeness, and a broad overview of the different techniques and algorithms used to solve the SAT problem is followed, noting that given vast amount of algorithms that have been proposed only the classical and most prominent are discussed.
Symmetry Breaking Predicates for SAT-based DFA Identification
TLDR
This work presents a technique to reduce the problem search space by enforcing an enumeration of DFA states in depth-first search (DFS) or breadth- first search (BFS) order and proposes symmetry breaking predicates, which can be added to Boolean formulae representing various DFA identification problems.
SAT-based model-checking for security protocols analysis
TLDR
Experimental results indicate that the approach scales up to industrial strength security protocols with performance comparable with (and in some cases superior to) that of other state-of-the-art protocol analysers.
Efficient software product-line model checking using induction and a SAT solver
TLDR
This paper shows how an induction-based verification method can be adapted to the SPLs, with the help of a SAT solver, and shows dramatic improvement of the technique over the existing binary decision diagram (BDD)-based techniques.
A framework for good SAT translations, with applications to CNF representations of XOR constraints
TLDR
A super-polynomial lower bound is shown on "good" representations of XOR-constraints under very general circumstances, and a rich picture begins to emerge, under the various hardness measurements.
On the possibility of faster SAT algorithms
We describe reductions from the problem of determining the satisfiability of Boolean CNF formulas (CNF-SAT) to several natural algorithmic problems. We show that attaining any of the following bounds…
...
...

References

SHOWING 1-10 OF 62 REFERENCES
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
TLDR
An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refutations is proved and an exponential separation between ordered and unrestricted resolution is proved.
Solving difficult SAT instances in the presence of symmetry
TLDR
This work articulates SAT instances that are unusually difficult for their size, including satisfiable instances derived from routing problems, using an efficient implementation to solve the graph automorphism problem and shows that in structured SAT instances difficulty may be associated with large numbers of symmetries.
SATO: An Efficient Propositional Prover
TLDR
Two techniques that are found eeective to improve SATO performance are discussed, one is about splitting rules; the other is about connict analysis.
Analysis of Two Simple Heuristics on a Random Instance of k-SAT
We consider the performance of two algorithms, GUC and SC studied by M. T. Chao and J. Franco SIAM J. Comput.15(1986), 1106?1118;Inform. Sci.51(1990), 289?314 and V. Chvatal and B. Reed…
Dependent and Independent Variables in Propositional Satisfiability
TLDR
The "independent variable selection (IVS) heuristic" is investigated, i.e., given a formula on the set of variables N, the selection is restricted to a - possibly small - subset S which is sufficient to determine a truth value for all the variables in N.
Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures
TLDR
It is shown that random formulas with a linear number of clauses can be efficiently certified as unsatisfiable in the Not-All-Equal-$3$-Sat sense and a similar result holds for the non-3-colourability of random graphs with alinear number of edges.
A study of proof search algorithms for resolution and polynomial calculus
TLDR
It is shown that the direct translation to polynomials of a CNF formula having short resolution proofs, cannot be refuted in PC with degree less than /spl Omega/ (log n).
Tuning SAT Checkers for Bounded Model Checking
TLDR
It is shown that the unique characteristics of BMC formulas can be exploited for a variety of optimizations in the SAT checking procedure, and proved their efficiency in many of the hard test cases, comparing to both the standard SAT procedure and a BDD-based model checker.
SAT Local Search Algorithms: Worst-Case Study
  • E. A. Hirsch
  • Computer Science
    Journal of Automated Reasoning
  • 2004
TLDR
Both upper and lower bounds of the form 2α n (α<1 is a constant) are proved for local search algorithms, and the class of linear-size formulas considered for the upper bound covers most of the DIMACS benchmarks; the satisfiability problem for this class of formulas is NP-complete.
A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search
...
...