Model theoretic syntax is concerned with studying the descriptive complexity of grammar formalisms for natural languages by defining their derivation trees in suitable logical for...
The problem of deciding query containment has important applications in classical query optimization and heterogeneous database systems. Query containment is undecidable for unres...
The paper deals with logically definable families of sets (or point-sets) of rational numbers. In particular we are interested whether the families definable over the real line wi...
We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), ex...
We present a new algorithm for model-checking weak monadic second-order logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipul...