Skip to main content
Springer Nature Link
Log in

Probabilistic analysis of the pure literal heuristic for the satisfiability problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

An algorithm for the SATISFIABILITY problem is presented and a probabilistic analysis is performed. The analysis is based on an instance distribution which is parametrized to simulate a variety of sample characteristics. The algorithm either correctly determines whether a given instance of SATISFIABILITY has a solution or gives up. It is shown that the algorithm runs in polynomial time and gives up with probability approaching zero as input size approaches infinity for a range of parameter values. This result is an improvement over the results in [3] and [4].

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C.A. Brown and P.W. Purdom, An average time analysis of backtracking, SIAM J. Comp. 10 (1981)583.

    Google Scholar 

  2. M. Davis and H. Putnam, A computing procedure for quantification theory, J. Assoc. Comput. Mech. 7(1960)201.

    Google Scholar 

  3. J. Franco and M. Pauli, Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem, Report No. CES-81-3 (Case Western Reserve University, 1981), Discr. Appl. Math. 5(1983)77.

    Google Scholar 

  4. A. Goldberg, Average case complexity of the satisfiability problem. Proc. 4th Workshop on Automated Deduction (Austin, Texas, 1979) p. 1–6.

  5. R.M. Karp, The probabilistic analysis of some combinatorial search problems, in: Algorithms and Complexity: New Directions and Recent Results, ed. J.F. Traub (Academic Press, 1976) p. 1–19.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Indiana University, 47405, Bloomington, IN, USA

    John Franco

Authors
  1. John Franco
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Franco, J. Probabilistic analysis of the pure literal heuristic for the satisfiability problem. Ann Oper Res 1, 273–289 (1984). https://doi.org/10.1007/BF01874393

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01874393

Keywords and phrases