Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem

117Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

Abstract

We look at the instance distributions used by Goldberg [3] for showing that the Davis Putnam Procedure has polynomial average complexity and show that, in a sense, all these distributions are unreasonable. We then present a 'reasonable' family of instance distributions F and show that for each distribution in F a variant of the Davis Putnam Procedure without the pure literal rule requires exponential time with probability 1. In addition, we show that adding subsumption still results in exponential complexity with probability 1. © 1983.

Cite

CITATION STYLE

APA

Franco, J., & Paull, M. (1983). Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem. Discrete Applied Mathematics, 5(1), 77–87. https://doi.org/10.1016/0166-218X(83)90017-3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free