Abstract
This paper discusses the informational equivalence problem for knowledge bases. The authors show that using some mathematical approach it is possible to attack this problem and end up with an implementable algorithm. An essential part of the paper is devoted to the explanation of the mathematical idea which stands behind this algorithm. The authors try to do that in common terms or, at least, in less formal terms. In the second part of the paper mathematical methods are applied to study the properties of automorphic equivalence of knowledge bases (multi-models) and show that this notion is much wider than the total isomorphism (identity) of knowledge bases. In order to make the paper self-contained, the reader is provided with the formal definition of a knowledge base. Further development of the theoretical approach presented in the paper can lead to practical applications. For example, it can be used for preventing duplication of information in knowledge bases and in other tasks of improving knowledge management.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
