An algorithm for improving the consistency of structural interoperability
Authors: Dulin S. K. , Ryabtsev A. B. 
Published: May 2024

Aim. The consistency of a collectively generated body of knowledge is one of the most difficult problems of artificial intelligence. Additionally, there is a very important aspect of the knowledge acquisition process, i.e., the availability of knowledge support tools. Within the overall scheme of operation of knowledge system maintenance procedures, those associated with ensuring the consistency of interrelated components hold a special place. Out of the lines of knowledge representation research, the study of the operating procedures of corporate knowledge systems stood out. One of its most unconquered challenges is finding an optimal structure for the interoperability of knowledge system components. Let us consider a set of n elements that represent agents, information systems or knowledge components, then we can set the goal of assessing the level of interoperability and present the structure of interoperability based on an analysis of preferred relationships between elements. Methods. Thus, the effect of the structure of interacting elements on the motivation for interoperability is to be taken into account based on certain features or characteristics in the structure of elements that contribute or hinder the achievement of interoperability. It was noted that the potential for establishing interoperability based on a structure of interrelated elements can be defined as structural interoperability. Accordingly, for the purpose of studying the tendency of information systems or elements to be interoperable depending on the correlation of their own features or characteristics, a structural correspondence methodology was proposed that allows evaluating groups of potentially close elements using the structural consistency apparatus. Modelling structural interoperability based on the analysis of the connections structure using the selected consistency criterion allows finding the consistent preimage that is the closest to the original set. The subsets of the found preimage indicate the preferred grouping of elements that enables interoperability with the least inconsistency. Results. As a result, the set of potentially interacting elements is divided into sets of elements motivated to interact. This paper proposes and justifies an algorithm for finding – for a random structure of elements – the closest consistent structure that allows concluding on the choice of the interoperability structure. Conclusions. Out of the analysis of the proposed algorithm and its alternative follows that, under defined conditions for the existence of structural interoperability, there are several options for an acceptable interoperability structure. However, finding the optimal option will require searching through all acceptable options, or using reasonable heuristics that take into account the specifics of the connectivity matrix of the original signed graph. Comparing the presented algorithms, it must be noted that the label propagation algorithm is evaluative in its nature. Meanwhile, despite the complexity of combinatorial estimates and transformations, the inconsistency reduction algorithm based on the vertex-to-vertex difference vector is a tool for permanent analysis and managing the consistency of sets of elements motivated for interoperability.