Skip to main content
SpringerLink
Log in

A bound on the length of a random derivation-search tree in general multi-premise calculi

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

Some complexity bounds are derived for random derivation-search trees in Post's calculus.

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

Access this article

Log in via an institution

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

Literature Cited

  1. S. Yu. Maslov, “Search of derivation in general calculi,” Zap. Nauchn. Seminarov LOMI,32, 59–65 (1972).

    Google Scholar 

  2. S. Yu. Maslov and E. D. Rusakov, “Probabilistic canonical calculi,” Zap. Nauchn. Seminarov LOMI,32, 66–76, (1972).

    Google Scholar 

  3. Yu. N. Kur'erov, “Equiprobable canonical calculi,” Semiotika Informatika, No. 17, 90–97 (1981).

    Google Scholar 

  4. E. L. Post, “Formal reduction of the general combinatorial decision problem,” Am. J. Math.,65, No. 2, 197–215 (1943).

    Google Scholar 

  5. Yu. N. Kur'erov, “Complexity of derivation search in multi-premise probabilistic canonical calculi,” 7th All-Union Conf. on Problems of Theoretical Cybernetics, Abstracts of Papers [in Russian], Part 1, Irkutsk (1985), pp. 112–113.

    Google Scholar 

  6. V. N. Sachkov, Probabilistic Measures in Combinatorial Analysis [in Russian], Nauka, Moscow (1978).

    Google Scholar 

  7. P. Erdös and A. Rényi, “On random graphs I,” Public. Math. (Debrecen),6, 290–297 (1959).

    Google Scholar 

  8. J. W. Moon, “A problem of random trees,” J. Comb. Theory,10, No. 2, 201–205 (1971).

    Google Scholar 

  9. Z. Dalil, “On the complexity of regular resolution and the Davis—Putnam procedure,” Theor. Comput. Sci., No.4, 23–46 (1977).

    Google Scholar 

  10. Z. Galil, “On resolution with clauses of bounded size,” SIAM J. Comput.,6, 444–459 (1977).

    Google Scholar 

  11. G. S. Tseitin, “On derivation complexity in propositional calculi,” Zap. Nauchn. Seminarov LOMI,8, 234–259 (1968).

    Google Scholar 

Download references

Authors
  1. Yu. N. Kur'erov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 112–115, May–June, 1991.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kur'erov, Y.N. A bound on the length of a random derivation-search tree in general multi-premise calculi. Cybern Syst Anal 27, 462–466 (1991). https://doi.org/10.1007/BF01068328

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation