Skip to main content
SpringerLink
Log in

A modified unification procedure

  • 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. M. Glushkov, K. P. Vershinin, Yu. V. Kapitonova, et al., “Language for notation of mathematical texts,” in: Automation of the Proof-Searching of Mathematical Theorems [in Russian], IK Akad. Nauk USSR, Kiev (1974), pp. 3–34.

    Google Scholar 

  2. Yu. V. Kapitonova, A. I. Degtyarev, and A. V. Lyaletskii, “Use of heuristics in programs for theorem proof searching (review),” Kibernetika, No. 4, 76–89, (1973).

    Google Scholar 

Download references

Authors
  1. M. K. Morokhovets
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 96–99, January–February, 1984.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Morokhovets, M.K. A modified unification procedure. Cybern Syst Anal 20, 147–152 (1984). https://doi.org/10.1007/BF01068881

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation