activity
20112026
most citedWhen Can We Answer Queries Using Result-Bounded Data Interfaces?

8 citations · 43 across the 20 of their papers we have counts for

collaborators

30 papers

cs.AI2026

Using LLMs for Explainable, Data-Driven Insight Generation from Time Series

Ria Mundhra, Gustavo Sato dos Santos, Michael Benedikt

Time series forecasts are widely used in decision-critical domains, where they are rarely consumed without accompanying explanations. Producing such explanations is usually a manua…

cs.LG2023

Towards Unbiased Exploration in Partial Label Learning

Zsolt Zombori, Agapi Rissaki, Kristóf Szabó +2

We consider learning a probabilistic classifier from partially-labelled supervision (inputs denoted with multiple possibilities) using standard neural architectures with a softmax…

cs.LO2023

The complexity of Presburger arithmetic with power or powers

Michael Benedikt, Dmitry Chistikov, Alessio Mansutti

We investigate expansions of Presburger arithmetic, i.e., the theory of the integers with addition and order, with additional structure related to exponentiation: either a function…

cs.LO2023

Embedded Finite Models Beyond Restricted Quantifier Collapse

Michael Benedikt, Ehud Hrushovski

We revisit evaluation of logical formulas that allow both uninterpreted relations, constrained to be finite, as well as an interpreted vocabulary over an infinite domain. This form…

cs.LO2022★ 5 cited

Rewriting the Infinite Chase

Michael Benedikt, Maxime Buron, Stefano Germano +2

Guarded tuple-generating dependencies (GTGDs) are a natural extension of description logics and referential constraints. It has long been known that queries over GTGDs can be answe…

cs.LO2022

Tighter Bounds for Query Answering with Guarded TGDs

Antoine Amarilli, Michael Benedikt

We consider the complexity of the open-world query answering problem, where we wish to determine certain answers to conjunctive queries over incomplete datasets specified by an ini…