Abstract
In the framework of the logical-axiomatic approach to pattern recognition problems, guaranteed estimates on the performance of the corresponding algorithms are derived by means of considering different formulations of problems including the problem of analysis of a compound object.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V. N. Fomin, Mathematical Theory of Learning Recognizing Systems (Leningr. Gos. Univ., Leningrad, 1976) [in Russian].
Yu. I. Zhuravlev, “On the Algebraic Approach to the Solution of Problems of Recognition and Classification,” in Problemy Kibernetiki (Problems of Cybernetics), Vol. 33 (Nauka, Moscow, 1978), pp. 5–78.
T. M. Kosovskaya and A. I. Timofeev, “On a New Approach to the Formation of Logical Decision Rules in Problems of Recognition,” Vestn. Leningr. Gos. Univ., Ser. 1, No. 8, 22–29 (1985).
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979; Mir, Moscow, 1982).
J. A. Robinson, “A Machine-Oriented Logic Based on Resolution Principle,” JACM 12(1), 23–41 (1965).
S. C. Kleene, Mathematical Logic (Wiley, New York, 1967; Mir, Moscow, 1973).
Yu. N. Kur’erov, “Conditions of Completeness of Linear Output,” in: Semanticheskie Voprosy Iskusstvennogo Intellekta (Semantic Problems of Artificial Intelligence) (Kiev, 1977), pp. 44–45.
Additional information
Original Russian Text © T.M. Kosovskaya, 2007, published in Vestnik Sankt-Peterburgskogo Universiteta. Seriya 1. Matematika, Mekhanika, Astronomiya, 2007, No. 4, pp. 82–90.
About this article
Cite this article
Kosovskaya, T.M. Estimating the number of steps that it takes to solve some problems of pattern recognition which admit logical description. Vestnik St.Petersb. Univ.Math. 40, 287–293 (2007). https://doi.org/10.3103/S1063454107040061
Received:
Issue Date:
DOI: https://doi.org/10.3103/S1063454107040061