research
∙
07/02/2023
Towards Unbiased Exploration in Partial Label Learning
We consider learning a probabilistic classifier from partially-labelled ...
share
research
∙
05/04/2023
The complexity of Presburger arithmetic with power or powers
We investigate expansions of Presburger arithmetic, i.e., the theory of ...
research
∙
04/18/2023
Embedded Finite Models beyond Restricted Quantifier Collapse
We revisit evaluation of logical formulas that allow both uninterpreted ...
research
∙
12/21/2022
Tighter bounds for query answering with Guarded TGDs
We consider the complexity of the open-world query answering problem, wh...
research
∙
12/16/2022
Rewriting the Infinite Chase
Guarded tuple-generating dependencies (GTGDs) are a natural extension of...
research
∙
12/06/2022
Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory
Derived datasets can be defined implicitly or explicitly. An implicit de...
research
∙
09/17/2022
Synthesizing Nested Relational Queries from Implicit Specifications
Derived datasets can be defined implicitly or explicitly. An implicit de...
research
∙
02/17/2022
Query Answering with Transitive and Linear-Ordered Data
We consider entailment problems involving powerful constraint languages ...
research
∙
11/12/2020
Scalable Querying of Nested Data
While large-scale distributed data processing platforms have become an a...
research
∙
06/01/2020
Two variable logic with ultimately periodic counting
We consider the extension of two variable logic with quantifiers that st...
research
∙
06/01/2020
Balancing expressiveness and inexpressiveness in view design
We study the design of data publishing mechanisms that allow a collectio...
research
∙
05/13/2020
Generating collection queries from proofs
Nested relations, built up from atomic types via tupling and set types, ...
research
∙
05/13/2020
Some Model Theory of Guarded Negation
The Guarded Negation Fragment (GNFO) is a fragment of first-order logic ...
research
∙
03/12/2020
On monotonic determinacy and rewritability for recursive queries and views
A query Q is monotonically determined over a set of views if Q can be ex...
research
∙
03/05/2020
Finite Open-World Query Answering with Number Restrictions
Open-world query answering is the problem of deciding, given a set of fa...
research
∙
06/03/2019
Reasoning about disclosure in data integration in the presence of source constraints
Data integration systems allow users to access data sitting in multiple ...
research
∙
11/14/2017
Goal-Driven Query Answering for Existential Rules with Equality
Inspired by the magic sets for Datalog, we present a novel goal-driven a...
research
∙
06/24/2017
