Relational schema mappings have been extensively studied in connection with data
integration and exchange problems, but mappings between XML schemas have not …

Changing a database schema is a fact of life in information systems, as a response to
changes inside the enterprise (eg, new users' requirements, correction of errors in the …

Modeling regular expressions (regexes) has been applied in abundant scenes, but at
present, there is a lack of comprehensive modeling for extended operators, which limits their …

In a data word or a data tree each position carries a label from a finite alphabet and a data
value from an infinite domain. Over data words we consider the logic \sfLTL^↓_1(\rmF), that …

We study models of incomplete information for XML, their computational properties, and
query answering. While our approach is motivated by the study of relational incompleteness …

Words and trees are amongst the most studied structures in computer science. In this thesis,
we focus on words and trees that can contain elements from some infinite alphabet, like for …

Edinburgh Research Explorer Page 1 Edinburgh Research Explorer The Impact of Disjunction on
Query Answering Under GuardedBased Existential Rules Citation for published version: Bourhis …

Expressive query languages are gaining relevance in knowledge representation (KR), and
new reasoning problems come to the fore. Especially query containment is interesting in this …

We reconsider the problem of containment of monadic datalog (MDL) queries in unions of
conjunctive queries (UCQs). Prior work has dealt with special cases, but has left the precise …

We study query containment in three closely related formalisms: monadic disjunctive
Datalog (MDDLog), MMSNP (a logical generalization of constraint satisfaction problems) …