5 papers:
- SAT-2012-KullmannZ #on the #reduction #satisfiability
- On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets (OK, XZ), pp. 270–283.
- SAT-2002-MonassonC #algorithm #analysis #exponential #random #satisfiability #scalability
- Restart method and exponential acceleration of random 3-SAT instances resolutions: A large deviation analysis of the Davis-Putnam-Loveland-Logemann algorithm (RM, SC), p. 11.
- CADE-2000-Baumgartner #first-order #named
- FDPLL — A First Order Davis-Putnam-Longeman-Loveland Procedure (PB), pp. 200–219.
- KR-1994-DechterR #revisited
- Directional Resolution: The Davis-Putnam Procedure, Revisited (RD, IR), pp. 134–145.
- CSL-1989-Goerdt #strict
- Davis-Putnam Resolution versus Unrestricted Resolution (AG), pp. 143–162.