I am broadly interested in applications of logic in computer science. My work focuses on the foundations of databases, modal logics, and decidable fragments of first-order modal logic.
I also study the interaction between logic and computation, including questions around query answering, games, and reasoning over systems with unboundedly many agents.
Here are the links to my DBLP and Google Scholar profiles.
This work proposes a simple fix-point algorithm for consistent query answering under primary key constraints and that works for all PTIME solvable self-join free boolean conjunctive queries (BCQs) and path BCQs. It also proves that there are some queries that involve self-joins that are solvable in PTIME, but not by the proposed algorithm.
This paper proves the complexity dichotomy for consistent query answering over two-atom self-join queries.
This paper studies boundedness for unions of conjunctive regular path queries over various restricted regular expressions to get better complexity bounds.
This paper considers various bundled fragments of first-order modal logic and classifies them as decidable, undecidable, and those that lose the finite model property (but their decidability is not known).
This paper studies the two variable fragment of term modal logic and proves that it is decidable.
The paper introduces a modal logic for reasoning about large anonymous games and equilibrium behavior using implicit quantification over players.
This paper studies the monodic fragment of propositional term modal logic and proves that it is decidable.