Search Results for author: Meghyn Bienvenu

Found 10 papers, 1 papers with code

Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments

1 code implementation16 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.

First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics

no code implementations19 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.

Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation

no code implementations12 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.

Abstract Argumentation

Finite LTL Synthesis with Environment Assumptions and Quality Measures

no code implementations31 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.

Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity

no code implementations4 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.

Combining Existential Rules and Transitivity: Next Steps

no code implementations28 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.

Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results

no code implementations11 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.

Nested Regular Path Queries in Description Logics

no code implementations28 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.

Prime Implicates and Prime Implicants: From Propositional to Modal Logic

no code implementations15 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.

Ontology-based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP

no code implementations28 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.

Cannot find the paper you are looking for? You can Submit a new open access paper.