no code implementations • 17 Feb 2022 • Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
We consider entailment problems involving powerful constraint languages such as frontier-guarded existential rules in which we impose additional semantic restrictions on a set of distinguished relations.
no code implementations • 11 Feb 2022 • Pierre Bourhis, Laurence Duchien, Jérémie Dusart, Emmanuel Lonca, Pierre Marquis, Clément Quinton
Under the same assumption, we present a pseudo polynomial-time algorithm that transforms $C$ into a d-DNNF circuit $C'$ satisfied exactly by the models of $C$ having a value among the top-$k$ ones.
no code implementations • 22 Oct 2020 • Pierre Bourhis, Carsten Lutz
We prove 2NEXPTIME-completeness and extend this result to monadic disjunctive Datalog and to OMQs.
no code implementations • 15 Jun 2020 • Pierre Bourhis, Michel Leclère, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana, Lily Galois
We study the notion of boundedness in the context of positive existential rules, that is, whether there exists an upper bound to the depth of the chase procedure, that is independent from the initial instance.
1 code implementation • 5 Mar 2020 • Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
We refute this and show that, given a nondeterministic sequential VA and an input document, we can enumerate the mappings of the VA on the document with the following bounds: the preprocessing is linear in the document size and polynomial in the size of the VA, and the delay is independent of the document and polynomial in the size of the VA.
no code implementations • 3 Jun 2019 • Michael Benedikt, Pierre Bourhis, Louis Jachiet, Michaël Thomazo
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.
1 code implementation • 24 Jul 2018 • Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
We refute this and show that, given a nondeterministic sequential VA and an input document, we can enumerate the mappings of the VA on the document with the following bounds: the preprocessing is linear in the document size and polynomial in the size of the VA, and the delay is independent of the document and polynomial in the size of the VA.