Automorphic Equivalence of Multi-modelsRecognition

Plotkin Tatjana

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

This work is licensed under Creative Commons Attribution–NonCommercial International License (CC BY-NC 4.0).

Abstract

In this paper we provide an implementable formal al-gorithm for knowledge bases equivalence verification based on theformal definition of knowledge base given by B. I. Plotkin in hisworks and also study some important properties of automorphicequivalence of models. In addition we show that notion of auto-morphic equivalence is much wider than the notion of isomorphism.

Author(s)

Table of Contents

Automorphic Equivalence of Multi-modelsRecognition

Abstract

Author(s)

Table of Contents

Related Articles

ON UNIQUENESS OF HOLOMORPHIC AND BOUNDED OUTSIDE THE CLOSED LOGARITHMIC SECTOR FUNCTIONS REPRESENTABLE BY LACUNARY POWER SERIES

COMPUTER DETECTING AND PROCESSING OF THE SIGNALS OF A FLAT-COIL ABSOLUTE-POSITION SENSOR BASED SEISMIC DETECTOR

Automorphic Equivalence of Multi-modelsRecognition

Abstract

Subscribe to TheGufo Newsletter​

Subscribe to TheGufo Newsletter