Skip to main content
SpringerLink
Log in

Use of heuristic procedures in search programs for proofs of theorems (survey)

  • Published:
Cybernetics Aims and scope

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

Literature Cited

  1. V. G. Bondarchuk and G. A. Gvedashvili, “Approach to the heuristic procedures of algebraic transformations,” Kibernetika, No. 4 (1969).

  2. A. L. Brudno, “Sides and estimates for curtailing the scanning of variants,” in: Problems of Cybernetics [in Russian], Part 10, Moscow (1963).

  3. V. M. Glushkov and Yu. V. Kapitonova, “Automation of the search for proofs of theorems and intelligent machines, Kibernetika, No. 5 (1972).

  4. S. Kanger, “Simplified method of proof for elementary logic,” in: Mathematical Theory of Logical Inference [in Russian], Izd. Nauka, Moscow (1967).

    Google Scholar 

  5. S. Yu. Maslov, “Search for a deduction as a model of a heuristic process,” Kibernetika, No. 5 (1972).

  6. S. Yu. Maslov, “Inverse method of establishing deducibility in classical predicate calculus,” Dokl. Akad. Nauk SSSR,159, No. 1 (1964).

  7. A. Yu. Plyushkevichene “Specialization of deductions in axiomatic theories with equality on the basis of removing intersections,” Author's Abstract of Dissertation, Izd. LOMI AN SSSR (1972).

  8. D. Poia, How to Solve a Problem [in Russian], Izd. “Uchpedgiz,” Moscow (1959).

    Google Scholar 

  9. D. Prawitz, “Achievements and problems in the development of procedures of mechanical proof,” Kiberneticheskii Sbornik, No. 9 (1972).

  10. J. L. Darlington, “A partial mechanization of second-order logic,” Machine Intelligence,6, 91–100 (1971).

    Google Scholar 

  11. A. Newell, “Some problems of basic organization in problem-solving programs,” Self-Organizing Systems, Spartan Books, Washington, D.C. (1962).

    Google Scholar 

  12. F. R. Slagle, “Experiments with M/N tree searching program,” Commun. Assoc. Comput. Machinery,13, No. 3 (1970).

  13. J. R. Slagle, “Automatic theorem proving with built-in theories including equality, partial ordering, and sets,” J. Assoc. Comput. Machinery,19, No. 1 (1972).

Download references

Authors
  1. Yu. V. Kapitonova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. I. Degtyarev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. V. Lyaletskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work is directly connected with the paper “A Brief Review and Bibliography of Investigations into Automation of Search of Theorem Proofs in Formal Theories,” published in Kibernetika, No. 5 (1972). The bibliography of the present paper is a continuation of the bibliography of the former work.

Translated from Kibernetika, No. 4, pp. 76–89, July–August, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kapitonova, Y.V., Degtyarev, A.I. & Lyaletskii, A.V. Use of heuristic procedures in search programs for proofs of theorems (survey). Cybern Syst Anal 9, 630–643 (1973). https://doi.org/10.1007/BF01068588

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation