The Quest for Efficient Boolean Satisfiability Solvers

By Lintao Zhang, Sharad Malik. International Conference on Computer Aided Verification, 2002

357 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Computing the Least Common Subsumer w.r.t. a Background Terminology (2004, background): “, [62]) can be used to handle non-implicational a priori knowledge.”
SATzilla: Portfolio-based Algorithm Selection for SAT (2008, unknown): “…high-performance SAT solvers include tree-search algorithms (see, e.g., Davis, Logemann, & Loveland, 1962; Zhang, Madigan, Moskewicz, & Malik, 2001; Zhang, 2002; Kullmann, 2002; Dubois & Dequen, 2001; Heule, Zwieten, Dufour, & Maaren, 2004; Eén & Sörensson, 2003), local search algorithms (see,…”
Handbook of satisfiability (2009, unknown): “, [78]), because in both cases two”
Handbook of Satisfiability (2021, methodology): “3 shows an online T -DPLL procedure based on a modern DPLL engine [157, 158].”
Computational Intelligence and Feature Selection - Rough and Fuzzy Approaches (2008, background): “Many other heuristics exist for this purpose [414] but are not considered here.”