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
SIGLETIB: RN 3147 (89) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...
International audienceEquivalence checking is a formal verification approach that consists in provin...
We solve the isomorphism problem for certain classes of unary automatic structures: unary automatic ...
Abstract. In this paper we provide an implementable formal al-gorithm for knowledge bases equivalenc...
AbstractUsing the theory of Borel equivalence relations we analyze the isomorphism relation on the c...
Using the theory of Borel equivalence relations we analyze the isomorphism relation on the countable...
AbstractThe complexity of array automata which compute Beyer's topological matching predicate is stu...
The calculation of the countable model automorphism number for uncountable categorical theories is t...
AbstractA model is computable if its domain is a computable set and its relations and functions are ...
: We argue that rather than representing an agent's knowledge as a collection of formulas, and ...
Abstract3-valued models have been advocated as a means of system abstraction such that verifications...
AbstractWe describe four complete and recursively enumerable formal systems S0,D0,H0,B0. Each one of...
Abstract: A criterion is obtained for existence of two isomorphic but not hyperarithmetically isomor...
We consider the language inclusion and equivalence problems for six different types of ω-automata; B...
AbstractA model theory for proving correctness of abstract data types is developed within the framew...
SIGLETIB: RN 3147 (89) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...
International audienceEquivalence checking is a formal verification approach that consists in provin...
We solve the isomorphism problem for certain classes of unary automatic structures: unary automatic ...
Abstract. In this paper we provide an implementable formal al-gorithm for knowledge bases equivalenc...
AbstractUsing the theory of Borel equivalence relations we analyze the isomorphism relation on the c...
Using the theory of Borel equivalence relations we analyze the isomorphism relation on the countable...
AbstractThe complexity of array automata which compute Beyer's topological matching predicate is stu...
The calculation of the countable model automorphism number for uncountable categorical theories is t...
AbstractA model is computable if its domain is a computable set and its relations and functions are ...
: We argue that rather than representing an agent's knowledge as a collection of formulas, and ...
Abstract3-valued models have been advocated as a means of system abstraction such that verifications...
AbstractWe describe four complete and recursively enumerable formal systems S0,D0,H0,B0. Each one of...
Abstract: A criterion is obtained for existence of two isomorphic but not hyperarithmetically isomor...
We consider the language inclusion and equivalence problems for six different types of ω-automata; B...
AbstractA model theory for proving correctness of abstract data types is developed within the framew...
SIGLETIB: RN 3147 (89) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...
International audienceEquivalence checking is a formal verification approach that consists in provin...
We solve the isomorphism problem for certain classes of unary automatic structures: unary automatic ...