Geodesic
Insertion machines
News of the Kabardin-Balkar scientific center of RAS, no. 1 (2011), pp. 169-180.

Voir la notice de l'article provenant de la source Math-Net.Ru

An architecture of insertion machines for analysis and synthesis of artificial intelligence systems is proposed in the paper. As an implementation of insertion model using the insertion modeling system IMS an insertion machine with easily extendable input language, calculation rules for insertion functions, insertion models interpretation and analysis program was built. New types of environments with their own insertion functions, drivers and other components building complicated environment for system functioning and advanced cognitive architectures bound to analysis and synthesis of artificial intelligence can be worked out on the basis of such a system.
Keywords: insertion modeling, multiagent systems, cognitive architecture, artificial intellect systems. 
@article{IZKAB_2011_1_a30,
     author = {A. A. Letichevskii},
     title = {Insertion machines},
     journal = {News of the Kabardin-Balkar scientific center of RAS},
     pages = {169--180},
     publisher = {mathdoc},
     number = {1},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IZKAB_2011_1_a30/}
}
TY  - JOUR
AU  - A. A. Letichevskii
TI  - Insertion machines
JO  - News of the Kabardin-Balkar scientific center of RAS
PY  - 2011
SP  - 169
EP  - 180
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IZKAB_2011_1_a30/
LA  - ru
ID  - IZKAB_2011_1_a30
ER  - 
%0 Journal Article
%A A. A. Letichevskii
%T Insertion machines
%J News of the Kabardin-Balkar scientific center of RAS
%D 2011
%P 169-180
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IZKAB_2011_1_a30/
%G ru
%F IZKAB_2011_1_a30
A. A. Letichevskii. Insertion machines. News of the Kabardin-Balkar scientific center of RAS, no. 1 (2011), pp. 169-180. http://geodesic.mathdoc.fr/item/IZKAB_2011_1_a30/

[1] D. R. Gilbert, A. A. Letichevsky, “A universal interpreter for nondeterministic concurrent programming languages”, Fifth Compulog network area meeting on language design and semantic analysis methods, eds. M. Gabbrielli, 1996

[2] A. Letichevsky, D. Gilbert, “A general theory of action languages”, Kibernetika i Sistemnyi Analiz, 1 (1998) | MR | Zbl

[3] A. Letichevsky, D. Gilbert, “Interaction of agents and environments”, in: Resent trends in Algebraic Development technique, eds. D. Bert and C. Choppy, Springer Verlag, 1999

[4] A. Letichevsky, “Algebra of behavior transformations and its applications”, Structural theory of Automata, Semigroups, and Universal Algebra, NATO Science, v. 207, II. Mathematics, Physics and Chemistry, eds. V.B. Kudryavtsev and I.G. Rosenberg, Springer, 2005, 241–272 pp. | MR

[5] A. Letichevsky, J. Kapitonova, Letichevsky A. (jr.), V. Volkov, S. Baranov, V. Kotlyarov, T. Weigert, “Basic Protocols Message Sequence Charts, and the Verification of Requirements Specifications”, Computer Networks, 47 (2005), 662–675

[6] S. Baranov, C. Jervis, V. Kotlyarov, A. Letichevsky, T. Weigert, Leveraging UML to deliver correct telecom applications in UML for Real: Design of Embedded Real-Time System, eds. L. Lavagno, G. Martin, and B. Selic, Kluwer Academic Publishers, 2003, 323–342 pp.

[7] J. Kapitonova, A. Letichevsky, V. Volkov, T. Weigert, “Validation of Embedded Systems”, The Embedded Systems Handbook, eds. R. Zurawski, CRC Press, Miami, 2005

[8] A. A. Letichevsky, J. V. Kapitonova, V. A. Volkov, A. A. jr. Letichevsky, S. N. Baranov, V. P. Kot lyarov, T. Weigert, System Specification with Basic Protocols, Cybernetics and System Analyses, v. 4, 2005 | MR

[9] A. A. Letichevsky, J. V. Kapitonova, Letichevsky A. A. (jr.), N. S. Nikitchenko, V. A. Volkov, T. Weigert, “Insertion modeling in distributed system design”, Problemy programmirovaniya, 4 (2008), 13–39

[10] R. Milner, “A Calculus of Communicating Systems”, Lecture Notes in Computer Science, 92 (1980), Springer-Verlag | DOI | MR | Zbl

[11] C. A.R. Hoare, Communicating Sequential Processes, Prentice Hall, 1985 | MR | Zbl

[12] R. Milner, “The polyadic-calculus: a tutorial”, Tech. Rep., 1991, 91–180, ECS-LFCS- Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, UK | MR

[13] L. Cardelli, Andrew D. Gordon., “Mobile ambients”, In Foundations of Software Sci ence and Computation Structures: First International Conference, FOSSACS '98, Springer Verlag, 1998 | MR

[14] Y. Gurevich, “Evolving algebras: an attempt to discover semantics”, Current Trends in Theoretical Computer Science, 1993, 266–292 | DOI

[15] C. A.R. Hoare, He Jifeng, Unifying Theories of Programming, Prentice Hall, 1999

[16] J. Meseguer, “Conditional rewriting logic as a unified model of concurrency”, Theoretical Computer Science, 96 (1992), 73–155 | DOI | MR | Zbl

[17] A. A. Letichevskii, Yu. V. Kapitonova, V. A. Volkov, V. V. Vyshemirskii, A. A. Letichevskii (ml. )., “Insertsionnoe programmirovanie”, Kibernetika i sistemnyi analiz, 2003, no. 1

[18] J. V. Kapitonova, A. A. Letichevsky, S. V. Konozenko, Computations in APS. Theoretical Computer Science, v. 171, 1993, 119-145 pp. | MR

[19] http://apsystem.org.ua/

[20] A. A. Letichevskii, Yu. V. Kapitonova, V. A. Volkov, A. A. Letichevskii (ml.), S. N. Baranov, V. P. Kotlyarov, T. Veigert, “Spetsifikatsiya sistem s pomoschyu bazovykh protokolov”, Kibernetika i sistemnyi analiz, 2005, no. 4, 3–22 | MR

[21] C. A.R. Hoare, “An axiomatic basis for computer programming”, Communications of the ACM, 12(10), 576-580, 583 \date October 1969 | DOI | Zbl

[22] R. W. Floyd, “Assigning meanings to programs”, Proceedings of the American Mathematical Society Symposia on Applied Mathematics, v. 19, 1967, 19–31 pp. | MR