RESEARCH
My work has focused on algorithms, complexity theory, formal languages, databases, and existential rules.
Research Internship
I studied static-analysis problems for guarded and frontier guarded existential rules, with a focus on chase termination and UCQ-rewritability.
The work uses complexity-theoretic and rewriting techniques to study when reasoning procedures terminate and when ontology-mediated queries admit finite rewritings.
Manuscript in preparation.
Research Project
I studied transformations from path queries under existential rules to Datalog programs, and the structure of languages generated by paths in the chase.
The project investigated how query answering can be understood through formal-language and database-theoretic techniques.
Research Internship
I worked on algorithmic and complexity questions for probabilistic words and context-free languages.
The project led to new tractability and hardness results for computing the probability that a word sampled from a probabilistic word belongs to a language.