My research is focused on model-theoretic aspects of decidable fragments of First-Order Logic and their applications to database-related reasoning problems. I study their expressive power, complexity of satisfiability, definability and succinctness. I enjoy the interplay between logic, databases, automata theory and algebra. I strongly believe that my research does not have any practical applications, nevertheless its true value comes from its mathematical beauty.
I am particularly interested in logics describing properties of trees and words, such as temporal logics (LTL, CTL), XPath and logics enjoining tree model property (modal logics, description logics, guarded fragments).
Project webpage: hereThe project deals with the formal foundations of knowledge management as well as their application in today's information society. Among the biggest challenges in this area are the intelligent access to digital information as well as the automated composition of information from diverse sources. For these purposes, logical specifications of background knowledge - so-called ontologies - can be used together with automated reasoning techniques in order to enable a "meaning-aware" handling of data. Unfortunately, reasoning in ontology languages of high expressivity is impossible to capture algorithmically – they are undecidable. Therefore, the quest for "good" ontology languages consists in identifying logical formalisms which are as expressive as possible, yet still decidable. Hitherto, the obtained results in this area have, however, been patchy and fragmented. The goal of the DeciGUT project is the creation of a unified theory of decidability, which in turn will enable the definition of new, advanced ontology languages. The project is of high relevance to diverse scientific fields like mathematical logic, artificial intelligence, and database theory with potentially far-reaching impact in areas such as semantic technologies and information systems.
Project webpage: [not yet]The main goal of the project is to develop decision procedures and to study theoretical properties of logics extended with generalized counting quantifiers. Such quantifiers will formalize a numerous constructs from natural language e.g. "at most", "an even number", "every five of", "at least" or "less than 70%".