This article surveys various complexity and expressiveness results on different forms of logic
programming. The main focus is on decidable forms of logic programming, in particular …

Многомерная открытая гносеологическая активная сеть MOGAN является основой для
перехода на качественно новый уровень создания логического искусственного …

1. Обучение и эволюционные накопление и обработка данных. Для того чтобы система
могла обучаться, ее подсистема накопления и обработки данных должна обладать …

This paper surveys various complexity results on different forms of logic programming. The
main focus is on decidable forms of logic programming, in particular propositional logic …

Finite model theory, as understoodhere, is an areaof mathematicallogic that has developed
in close connection with applications to computer science, in particular the theory of …

" Constraints, such as linear or polynomial equalities, are used to finitely represent possibly
infinite sets of points. They provide an elegant way to combine classical relational data with …

Motivated by computer science challenges, we suggest to extend the approach and
methods of finite model theory beyond finite structures. We study definability issues and their …

In this paper, we give a new algorithm for quantifier elimination in the first order theory of real
closed fields that improves the complexity of the best known algorithm for this problem till …

We study query language for topological properties of twodimensional spatial databases,
starting from the topological relationships between pairs of planar regions introduced by …

We study analogs of classical relational calculus in the context of strings. We start by
studying string logics. Taking a classical model-theoretic approach, we fix a set of string …