1 citations · 1 across the 4 of their papers we have counts for
5 papers
Logically automorphically equivalent knowledge bases
Elena Aladova, Tatjana Plotkin
Knowledge bases theory provide an important example of the field where applications of universal algebra and algebraic logic look very natural, and their interaction with practical…
Multi-sorted logic, models and logical geometry
Elena Aladova, Aleko Gvaramia, Boris Plotkin +1
Let be a variety of algebras, be a model, where is an algebra from , is a set of relation symbols , is an interpretation of all in . Let $X…
Decompositions and complexity of linear automata
Boris Plotkin, Tatjana Plotkin
The Krohn-Rhodes complexity theory for pure (without linearity) automata is well-known. This theory uses an operation of wreath product as a decomposition tool. The main goal of th…
Automata and automata mappings of semigroups
Boris Plotkin, Tatjana Plotkin
The paper is devoted to two types of algebraic models of automata. The usual (first type) model leads to the developed decomposition theory (Krohn-Rhodes theory). We introduce anot…
Knowledge bases over algebraic models. Some notes about informational equivalence
Knyazhansky Marina, Plotkin Tatjana
The recent advances in knowledge base research and the growing importance of effective knowledge management raised an important question of knowledge base equivalence verification.…