代数模型上的知识库。关于信息等价的几点注记
Knowledge bases over algebraic models. Some notes about informational equivalence
摘要：
知识库研究的最新进展和有效知识管理的重要性日益增加，提出了一个重要的问题，知识库等价性验证。这个问题之前没有提到，至少在某种程度上，允许谈论算法的信息等价性的验证，因为知识库的非正式定义使得这个问题的正式解决方案是不可能的。本文在Plotkin B.和Plotkin T.，研究了模型的自守等价的一些重要性质。我们还描述了等价的概念，并制定了标准的等价性的知识库定义在有限的模型。进一步定义了多模型、模型的自守等价和多模型，即代数的自守等价的推广。
英文摘要：
The recent advances in knowledge base research and the growing importance of effective knowledge management raised an important question of knowledge base equivalence verification. This problem has not been stated earlier, at least in a way that allows speaking about algorithms for verification of informational equivalence, because the informal definition of knowledge bases makes formal solution of this problem impossible. In this paper we provide an implementable formal algorithm for knowledge base equivalence verification based on the formal definition of knowledge base proposed by Plotkin B. and Plotkin T., and study some important properties of automorphic equivalence of models. We also describe the concept of equivalence and formulate the criterion for the equivalence of knowledge bases defined over finite models. Further we define multi-models and automorphic equivalence of models and multi-models, that is generalization of automorphic equivalence of algebras.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
