I like puzzles, feta cheese and travelling. When I'm not daydreaming (therefore, mostly at night) I study logic and computation with applications to machine reasoning.

Currently, I'm a postdoc in Valda team of DI ENS.

I was born in Moscow and learned to walk, talk and quick-sort there. I did a PhD from 2021 to 2026 in the mountains of South Tyrol, under the guidance of Alessandro Artale and Nicola Gigante. Since then, I have been living in Paris. Check my cv for more details.

---

Logics for Temporal Graphs

A temporal graph evolves in time by adding, removing and changing its nodes and edges. Formulas of temporal logic describe such evolution of discrete structures, much like differential equations describe that of continuous processes. Formulas are combined into "logical programs" used to derive implicit information and answer queries over the data.

The "complexity" of the logical inference determines how fast the answer to the query is computed. My recent work with Alessandro Artale, Vladislav Ryzhikov and Michael Zakharyaschev focused on identifying the features of programs that make them slow to compute. Together with Camille Bourgaux and Michaël Thomazo we have been studying connections between temporal logics and formal grammars, obtaining some nice theoretical and algorithmic results.

Ontoplex

Ontology of complexity, i.e. a knowledge base of notions and results in computational complexity theory.

When ready, it can be used to query, visualise and automatically process the "big picture of complexity theory", something that is now available only in the heads of the experts. The applications are in education, facilitation of research, and (as a bold dream) automated discovery of new results.

Together with Oliver Kutz and Nicolas Troquard, we have made the first steps in ontological modelling of this abstract domain. My current focus is on expanding these findings and making them practical; a very preliminary implementation can be found here.

---

My favourite language learning app: Busuu.

---