no code implementations • 6 Jun 2023 • Meghyn Bienvenu, Camille Bourgaux
Finally, we clarify the relationship between optimal repairs of prioritized databases and repair notions introduced in the framework of active integrity constraints.
no code implementations • 26 May 2023 • Meghyn Bienvenu, Gianluca Cima, Víctor Gutiérrez-Basulto, Yazmín Ibáñez-García
In the recently proposed Lace framework for collective entity resolution, logical rules and constraints are used to identify pairs of entity references (e. g. author or paper ids) that denote the same entity.
1 code implementation • 16 Feb 2022 • Meghyn Bienvenu, Camille Bourgaux
We investigate practical algorithms for inconsistency-tolerant query answering over prioritized knowledge bases, which consist of a logical theory, a set of facts, and a priority relation between conflicting facts.
no code implementations • 19 Nov 2020 • Meghyn Bienvenu, Peter Hansen, Carsten Lutz, Frank Wolter
We study FO-rewritability of conjunctive queries in the presence of ontologies formulated in a description logic between EL and Horn-SHIF, along with related query containment problems.
no code implementations • 12 Mar 2020 • Meghyn Bienvenu, Camille Bourgaux
The second contribution of our work is to clarify the relationship between optimal repairs and different notions of extensions for (set-based) argumentation frameworks.
no code implementations • 31 Aug 2018 • Alberto Camacho, Meghyn Bienvenu, Sheila A. McIlraith
In this paper, we investigate the problem of synthesizing strategies for linear temporal logic (LTL) specifications that are interpreted over finite traces -- a problem that is central to the automated construction of controllers, robot programs, and business processes.
no code implementations • 4 May 2016 • Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir Podolskii, Michael Zakharyaschev
We give solutions to two fundamental computational problems in ontology-based data access with the W3C standard ontology language OWL 2 QL: the succinctness problem for first-order rewritings of ontology-mediated queries (OMQs), and the complexity problem for OMQ answering.
no code implementations • 28 Apr 2015 • Jean-François Baget, Meghyn Bienvenu, Marie-Laure Mugnier, Swan Rocher
In this paper, we address the issue of whether transitivity can be safely combined with decidable classes of existential rules.
no code implementations • 11 Jun 2014 • Meghyn Bienvenu, Stanislav Kikot, Vladimir Podolskii
Our first contribution is to clarify the worst-case size of positive existential (PE), non-recursive Datalog (NDL), and first-order (FO) rewritings for various classes of tree-like conjunctive queries, ranging from linear queries to bounded treewidth queries.
no code implementations • 28 Feb 2014 • Meghyn Bienvenu, Diego Calvanese, Magdalena Ortiz, Mantas Simkus
Two-way regular path queries (2RPQs) have received increased attention recently due to their ability to relate pairs of objects by flexibly navigating graph-structured data.
no code implementations • 15 Jan 2014 • Meghyn Bienvenu
The purpose of this paper is to examine how these notions might be appropriately extended from propositional logic to the modal logic K. We begin the paper by considering a number of potential definitions of clauses and terms for K. The different definitions are evaluated with respect to a set of syntactic, semantic, and complexity-theoretic properties characteristic of the propositional definition.
no code implementations • 28 Jan 2013 • Meghyn Bienvenu, Balder ten Cate, Carsten Lutz, Frank Wolter
Ontology-based data access is concerned with querying incomplete data sources in the presence of domain-specific knowledge provided by an ontology.