We consider learning a probabilistic classifier from partially-labelled
...
We investigate expansions of Presburger arithmetic, i.e., the theory of ...
We revisit evaluation of logical formulas that allow both uninterpreted
...
We consider the complexity of the open-world query answering problem, wh...
Guarded tuple-generating dependencies (GTGDs) are a natural extension of...
Derived datasets can be defined implicitly or explicitly. An implicit
de...
Derived datasets can be defined implicitly or explicitly. An implicit
de...
We consider entailment problems involving powerful constraint languages ...
While large-scale distributed data processing platforms have become an
a...
We consider the extension of two variable logic with quantifiers that st...
We study the design of data publishing mechanisms that allow a collectio...
Nested relations, built up from atomic types via tupling and set types, ...
The Guarded Negation Fragment (GNFO) is a fragment of first-order logic ...
A query Q is monotonically determined over a set of views if Q can be
ex...
Open-world query answering is the problem of deciding, given a set of fa...
Data integration systems allow users to access data sitting in multiple
...
Inspired by the magic sets for Datalog, we present a novel goal-driven
a...
We consider answering queries where the underlying data is available onl...