Evidence Algorithm and Sad Systems: Past and Possible Future-Reference-Cited by-同舟云学术

Evidence Algorithm and Sad Systems: Past and Possible Future

Published:2021-01 Issue:1 Volume:57 Page:9-15
ISSN:1060-0396
Container-title:Cybernetics and Systems Analysis
language:en
Short-container-title:Cybern Syst Anal

Author:

Lyaletski A. V.

Publisher

Springer Science and Business Media LLC

Subject

General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s10559-021-00325-1.pdf

Reference12 articles.

1. V. M. Glushkov, “Some problems in the theories of automata and artificial intelligence,” Cybern. Syst. Analysis, Vol. 6, No. 2, 17–27 (1970). https://doi.org/10.1007/BF01070496.

2. A. Lyaletski, M. Morokhovets, and A. Paskevich, “Kyiv school of automated theorem proving: A historical chronicle,” in: Logic in Central and Eastern Europe: History, Science, and Discourse, University Press of America, Lanham (2012), pp. 431–469.

3. K. Vershinine and A. Paskevich, “ForTheL — the language of formal theories,” Intern. J. of Inform. Theories and Applications, Vol. 7, No. 3, 120–126 (2000).

4. V. M. Glushkov, Yu. V. Kapitonova, A. A. Letichevskii, K. P. Vershinin, and N. P. Malevanyi, “Construction of a practical formal language for mathematical theories,” Cybern. Syst. Analysis, Vol. 8, No. 5, 730–739 (1972). https://doi.org/10.1007/BF01068445.

5. Otter Homepage. URL: http://www.mcs.anl.gov/research/projects/other/.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Applying Algebraic Virtual Machine to Cybersecurity Tasks;2022 IEEE 9th International Conference on Sciences of Electronics, Technologies of Information and Telecommunications (SETIT);2022-05-28