Publication:5687274
From MaRDI portal
zbMath0868.03007MaRDI QIDQ5687274
Allen van Gelder, Yumi K. Tsuji
Publication date: 19 August 1997
reasoning; guessing; statistical performance analysis; Davis-Putnam algorithm; \(k\)-limited resolution; algorithm for propositional satisfiability; application of statistics to computer experiments
Related Items
A parallelization scheme based on work stealing for a class of SAT solvers, How good are branching rules in DPLL?, Approximating minimal unsatisfiable subformulae by means of adaptive core search, Equivalent literal propagation in the DLL procedure, On the limit of branching rules for hard random unsatisfiable 3-SAT, Efficient data structures for backtrack search SAT solvers, Toward leaner binary-clause reasoning in a satisfiability solver, A complete adaptive algorithm for propositional satisfiability, Solving satisfiability problems using elliptic approximations -- effective branching rules, Partitioning methods for satisfiability testing on large formulas, A perspective on certain polynomial-time solvable classes of satisfiability, New methods for 3-SAT decision and worst-case analysis, Another look at graph coloring via propositional satisfiability, Unnamed Item
Uses Software
