activity
20122022
most citedBisimilarity of Pushdown Systems is Nonelementary

3 citations · 6 across the 3 of their papers we have counts for

collaborators
Showing cs.LOShow all

5 papers · 1 filter

cs.LO2020

Balancing expressiveness and inexpressiveness in view design

Michael Benedikt, Pierre Bourhis, Louis Jachiet +1

We study the design of data publishing mechanisms that allow a collection of autonomous distributed datasources to collaborate to support queries. A common mechanism for data publi…

cs.LO2020

Some Model Theory of Guarded Negation

Vince Barany, Michael Benedikt, Balder ten Cate

The Guarded Negation Fragment (GNFO) is a fragment of first-order logic that contains all positive existential formulas, can express the first-order translations of basic modal log…

cs.LO2020

On monotonic determinacy and rewritability for recursive queries and views

Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja +1

A query Q is monotonically determined over a set of views if Q can be expressed as a monotonic function of the view image. In the case of relational algebra views and queries, mono…

cs.LO2020

Finite Open-World Query Answering with Number Restrictions

Antoine Amarilli, Michael Benedikt

Open-world query answering is the problem of deciding, given a set of facts, conjunction of constraints, and query, whether the facts and constraints imply the query. This amounts…

cs.LO2019

Reasoning about disclosure in data integration in the presence of source constraints

Michael Benedikt, Pierre Bourhis, Louis Jachiet +1

Data integration systems allow users to access data sitting in multiple sources by means of queries over a global schema, related to the sources via mappings. Data sources often co…