Computer Science – Logic in Computer Science
Scientific paper
2008-07-04
Computer Science
Logic in Computer Science
22 pages
Scientific paper
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.
Marina Knyazhansky
Tatjana Plotkin
No associations
LandOfFree
Knowledge bases over algebraic models. Some notes about informational equivalence does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Knowledge bases over algebraic models. Some notes about informational equivalence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Knowledge bases over algebraic models. Some notes about informational equivalence will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-597933