Sergey M. Dudakov

On Complexity of Updates through Integrity Constraints

Alexandre Ja. Dikovsky, Michael I. Dekhtyar, Sergey M. Dudakov, 2000, Computational Logic.

Maximal state independent approximations to minimal real change

Nicolas Spyratos, Alexandre Ja. Dikovsky, Michael I. Dekhtyar, 2001, Annals of Mathematics and Artificial Intelligence.

On Safety of Unary and Nonunary IFP Operators

Sergey M. Dudakov, 2018 .

Maximal Expansions of Database Updates

Nicolas Spyratos, Alexandre Ja. Dikovsky, Michael I. Dekhtyar, 2000, FoIKS.

Monotone Expansion of Updates in Logical Databases

Nicolas Spyratos, Alexandre Ja. Dikovsky, Michael I. Dekhtyar, 1999, LPNMR.

The Concurrency Complexity for the Horn Fragment of Linear Logic

Sergey M. Dudakov, 1997, LFCS.

On the Complexity of Perfect Models of Logic Programs

Sergey M. Dudakov, 1999, Fundam. Informaticae.

On Decidability of Regular Languages Theories

Sergey M. Dudakov, Boris Karlov, 2019, CSR.

Isolation and Reducibility Properties and the Collapse Result

Sergey M. Dudakov, 2006, CSR.