Abstract
A series of research works on the realization of the “evidence algorithm” program initiated by V. M. Glushkov in the sixties is described. The works are planned in the context of a new understanding of the theorem-proving problem and according to modern trends in information technologies and computer science.
Similar content being viewed by others
References
V. M. Glushkov, “Some problems of the theory of automata and artificial intelligence,” Kibernetika, No. 2, 3–13 (1970).
V. M. Glushkov, Foundations of Mathematics and Automation of Deductive Constructions. Problems of the Theory and Practice of Cybernetics [in Russian], Nauka, Moscow (1986).
F. V. Anufriyev, V.V. Fedyurko, A. A. Letichevskii, Z. M. Asel’derov, and I. I. Diduk, “An algorithm of search for proofs of theorems in the theory of groups,” Kibernetika, No. 1, 23–29 (1966).
F. V. Anufriyev. “An algorithm of search for proofs of theorems in logical calculi,” in: The Theory of Automata, IK AN USSR, Kiev (1969), pp. 3–26.
V. M. Glushkov, V. F. Kostyrko, A. A. Letichevskii, F. V. Anufriyev, and Z. M. Asel’derov, “A language for description of formal theories,” Teor. Kibern., No. 3, 4–31 (1970).
V. M. Glushkov, K. P. Vershinin, Yu. V. Kapitonova, at al., “A formal language for description of mathematical texts,” in: Automation of Theorem Proving in Mathematics, IK AN USSR, Kiev (1974), pp. 3–36.
A. I. Degtyarev and A. V. Lyaletski, “Logical inference in a system of automation of theorem proving,” in: “Mathematical Foundations of Systems of Artificial Intelligence,” IK AN USSR, Kiev (1981), pp. 3–11.
A. I. Degtyarev, “A strategy of monotonie paramodulation,” in: Proc. of the 5th All-Union. Conf. on Math. Logic, Novosibirsk (1979), p. 39.
V. V. Atayan and K. P. Vershinin, “Formalization of some techniques of inference search,” in: Automation of Processing of Mathematical Texts, IK AN USSR (1980), pp. 36–52.
Yu. V. Kapitonova, K. P. Vershinin, A. I. Degtyarev, A. P. Zhezherun, and A. V. Lyaletski, “System for processing mathematical texts,” Kibernetika, No. 2, 48 (1979).
V. M. Glushkov, “System for automation of theorem proving,” in: Automation of Processing Mathematical Texts, IK AN USSR, Kiev (1980), pp. 3–30.
A. V. Lyaletski, “Parallelism in inference search in computer-oriented Gentzen calculi,” in: Proc. of the Intern. Conf. Knowledge-Dialogue-Solution, (KDS-95),1, Yalta (1995), pp. 136–140.
V. V. Atayan and M. K. Morokhovets, “Combining formal derivation search procedures and natural theorem-proving techniques in an automated theorem proving system” Kibern. Syst. Anal., No. 3, 151–182 (1996).
K. P. Vershinin, “Relationship between a formal language of mathematical theories and axiomatic systems of the theory of sets,” Kibernetika, No. 4, 68–73 (1973).
Yu. V. Kapitonova, A.A. Letichevskiy, A.V. Lyaletskiy, and M.K. Morokhovets, “Algoritm Ochevidnosti’2000,” in: Proc. of the 1st Intern. Sci. Pract. Conf. on Programming UkrPROG’98, Inst. of Program Systems of NANU, Kyiv (1998), pp. 68–70.
A. Yu. Paskevich, “Distinctive features of realization of a high-level language for the representation of mathematical texts,” Visnyk Kyivskogo Univ., No. 2, 284–288 (1999).
A. A. Letichevsky, Yu. V. Kapitonova, and S. V. Konozenko, “Computations in APS,” Theor. Comput. Sci.,119, 145–171 (1993).
A. I. Degtyarev, A. V. Lyaletski, and M. K. Morokhovets, “Evidence algorithm and sequent logical inference search,” Lect. Notes Artif. Intell.,1705, 44–61 (1999).
Yu. V. Kapitonova and A. A. Letichevskii, “Theorem proving in a mathematical information environment,” Kibern. Sist. Anal., No. 4, 3–12 (1998).
Yu. V. Kapitonova, A. A. Letichevsky, M. S. L’vov, and V. A. Volkov, “Tools for solving problems in the scope of algebraic programming,” Lect. Notes Comput. Sci.,958, 31–46 (1995).
The MIZAR Home Page / http://mizar.uw.bialystok/pl/
B. Buchberger, T. Jebelean, F. Kriftner, M. Marin, E. Tomuta, and D. Vasaru, “A survey of the Theorema project,” in: Intern. Symp. in Symbolic and Algebraic Computation (ISSAC’97), Maui Hawaii, ACM Press, (1997), pp. 384–391.
The QED Manifesto / http://www.Cybercom.net/~rbjones/rbjpub/logic/qedresOO.htm
M. Kerber, M. Kohlhase, and V. Sorge, “Integrating computer algebra with proof planning,” Lecture Notes. Comput. Sci.,1128, 216–227 (1996).
Isabelle / http://www.cl.cam.ac.uk/Research/HVG/Isabelle/
The OpenMath Esprit Project / http://www.nag.co.uk/projects/openmath/
W3C’s Math Home Page / http://www.w3.org/Math/
Author information
Authors and Affiliations
Additional information
Translated from Kibemetika i Sistemnyi Analiz, No. 6, pp. 9–17, November–December, 1999.
Rights and permissions
About this article
Cite this article
Degtyarev, A.I., Kapitonova, Y.V., Letichevskii, A.A. et al. The evidence algorithm and problems of representation and processing of mathematical computer knowledge. Cybern Syst Anal 35, 853–859 (1999). https://doi.org/10.1007/BF02742275
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02742275