Theory of interaction, insertion modeling, and cognitive architectures

Abstract The paper presents a new cognitive architecture based on insertion modeling, one of the paradigms of a general theory of interaction, and a basis for multiagent system development. Insertion cognitive architecture is represented as a multilevel insertion machine which realizes itself as a high-level insertion environment. It has a center to evaluate the success of its behavior, which is a special type agent that can observe the interaction of a system with external environment. The main goal of a system is achieving maximum success repeated. Considered as an agent this machine is inserted into its external environment and has the means to interact with it. The internal environment of intelligent cognitive agent creates and develops its own model and the model of external environment. If the external environment contains other agents, they can be modeled by internal environment, which creates corresponding machines and interprets those machines using corresponding drivers, comparing the behaviors of models and external agents. Insertion architecture is now under development on the base of Insertion modeling system, developed in Glushkov Institute of Cybernetics. The nearest application will be the cognitive intellectual agent for software understanding.

[1]  M. Minsky The Society of Mind , 1986 .

[2]  C. Petri Kommunikation mit Automaten , 1962 .

[3]  В. М. Глушков Об одном алгоритме синтеза абстрактных автоматов@@@On an algorithm of synthesis of abstract automats , 1960 .

[4]  Luca Cardelli,et al.  BioAmbients: an abstraction for biological compartments , 2004, Theor. Comput. Sci..

[5]  Alexander A. Letichevsky Algebra of behavior transformations and its applications , 2005 .

[6]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[7]  Alexei V. Samsonovich,et al.  Toward a Unified Catalog of Implemented Cognitive Architectures , 2010, BICA.

[8]  J. Hawkins,et al.  On Intelligence , 2004 .

[9]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[10]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[11]  David Gilbert,et al.  Interaction of agents and environments , 1998 .

[12]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[13]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[14]  Nicholas R. Jennings,et al.  The Gaia Methodology for Agent-Oriented Analysis and Design , 2000, Autonomous Agents and Multi-Agent Systems.

[15]  David Gilbert,et al.  A general theory of action languages , 1998 .

[16]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[17]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[18]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[19]  Carl Hewitt,et al.  A Universal Modular ACTOR Formalism for Artificial Intelligence , 1973, IJCAI.

[20]  Thomas Weigert,et al.  Basic protocols, message sequence charts, and the verification of requirements specifications , 2005, Comput. Networks.

[21]  Dmitri A. Rachkovskij,et al.  Building a world model with structure-sensitive sparse binary distributed representations , 2013, BICA 2013.

[22]  V. M. Glushkov Automata theory and structural design problems of digital machines , 1965 .

[23]  W. Pitts,et al.  A Logical Calculus of the Ideas Immanent in Nervous Activity (1943) , 2021, Ideas That Created the Future.

[24]  V. M. Glushkov,et al.  Theory of Algorithms and Discrete Processors , 1969 .