This is a preview of subscription content, log in via an institution to check access.
Literature Cited
V. M. Glushkov, “Some problems of the theory of automata and artificial intelligence,” Kibernetika, No. 2 (1970).
V. M. Glushkov and Yu. V. Kapitonova, “Automation of the search for proofs of theorems of mathematical theories and intelligent machines,” Kibernetika, No. 5, 2–6 (1972).
G. A. Robinson, “Machine-oriented logic based on the principle of resolution,” Cybernetics Collection [Russian translation], No. 7, Moscow (1970).
G. Robinson and L. Wos, “Paramodulation and theorem-proving in first-order theories with equality,” Machine Intelligence, No. 4 (1969).
V. M. Glushkov, Yu. V. Kapitonova, A. A. Letichevskii, K. P. Vershin, and N. P. Maleyanyi, “Construction of a practical formal language for the description of mathematical theories,” Kibernetika, No. 5, 19–28 (1972).
F. V. Anufriev and Z. M. Asel'derov, “The obviousness algorithm,” Kibernetika, No. 5, 29–60 (1972).
Additional information
Translated from Kibernetika, No. 4, pp. 74–75, July–August, 1973.
Rights and permissions
About this article
Cite this article
Degtyarev, A.I. Question of constructing a problem-oriented procedure for the proof of theorems. Cybern Syst Anal 9, 628–629 (1973). https://doi.org/10.1007/BF01068587
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068587