Abstract
In this paper we provide an implementable formal algorithm for knowledge bases equivalence verification based on the formal definition of knowledge base given by B. I. Plotkin in his works and also study some important properties of automorphic equivalence of models. In addition we show that notion of automorphic equivalence is much wider than the notion of isomorphism.
Original language | American English |
---|---|
Pages (from-to) | 10-24 |
Journal | Armenian Journal of Mathematics |
Volume | 1 |
Issue number | 2 |
State | Published - 2008 |