Meghyn Bienvenu

Computing and Explaining Query Answers over Inconsistent DL-Lite Knowledge Bases.

(2019)

EIBibtex

Finite LTL Synthesis with Environment Assumptions and Quality Measures.

J. Artif. Intell. Res., (2019): 563-644

EIBibtex

Alberto Camacho,Meghyn Bienvenu,Sheila A. McIlraith

KR, (2018): 454-463

Cited by4EIBibtex

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

Meghyn Bienvenu,Stanislav Kikot,Roman Kontchakov,Vladimir V. Podolskii,Michael Zakharyaschev

Journal of the ACM, no. 5 (2018)

Cited by10EIBibtex

Inconsistency-Tolerant Ontology-Based Data Access Revisited: Taking Mappings into Account.

Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151).

IJCAI, pp.1721-1729, (2018)

Cited by2EIBibtex

Serge Abiteboul,Marcelo Arenas,Pablo Barceló,Meghyn Bienvenu,Diego Calvanese,Claire David,Richard Hull,Eyke Hüllermeier,Benny Kimelfeld,Leonid Libkin,Wim Martens,Tova Milo

Dagstuhl Manifestos, no. 1 (2018)

Cited by15EIBibtex

On the Parametrised Complexity of Tree-Shaped Ontology-Mediated Queries in OWL 2 QL.

Meghyn Bienvenu,Stanislav Kikot,Roman Kontchakov,Vladislav Ryzhikov,Michael Zakharyaschev

Description Logics, (2017)

Cited by1EIBibtex

Ontology-Mediated Query Answering for Key-Value Stores.

Meghyn Bienvenu,Pierre Bourhis,Marie-Laure Mugnier,Sophie Tison,Federico Ulliana

IJCAI, pp.844-851, (2017)

Cited by2EIBibtex

Optimal Nonrecursive Datalog Rewritings of Linear TGDs and Bounded (Hyper)Tree-Width Queries.

Meghyn Bienvenu,Stanislav Kikot,Roman Kontchakov,Vladislav Ryzhikov,Michael Zakharyaschev

Description Logics, (2017)

Cited by1EIBibtex

Research Directions for Principles of Data Management (Abridged).

Serge Abiteboul,Marcelo Arenas,Pablo Barceló,Meghyn Bienvenu,Diego Calvanese,Claire David,Richard Hull,Eyke Hüllermeier,Benny Kimelfeld,Leonid Libkin,Wim Martens,Tova Milo

ACM SIGMOD Record, no. 4 (2017): 5-17

Cited by16EIBibtex

Answering Conjunctive Regular Path Queries over Guarded Existential Rules.

Jean-François Baget,Meghyn Bienvenu,Marie-Laure Mugnier,Michaël Thomazo

IJCAI, pp.793-799, (2017)

Cited by1EIBibtex

The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries.

Meghyn Bienvenu,Stanislav Kikot,Roman Kontchakov,Vladimir V. Podolskii,Vladislav Ryzhikov,Michael Zakharyaschev

PODS, (2017)

Cited by10EIBibtex

Theoretically Optimal Datalog Rewritings for OWL 2 QL Ontology-Mediated Queries.

Meghyn Bienvenu,Stanislav Kikot,Roman Kontchakov,Vladimir V. Podolskii,Michael Zakharyaschev

Description Logics, (2016)

Cited by3EIBibtex

Can You Imagine... A Language for Combinatorial Creativity?

Fabian M. Suchanek, Colette Menard,Meghyn Bienvenu, Cyril Chapellier

International Semantic Web Conference, pp.532-548, (2016)

Cited by6EIBibtex

Query-Driven Repairing of Inconsistent DL-Lite Knowledge Bases.

Ontology-Mediated Query Answering: Harnessing Knowledge to Get More from Data.

IJCAI, pp.957-964, (2016)

Cited by16EIBibtex

On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules.

IJCAI, pp.4058-4061, (2016)

Cited by5EIBibtex

Meghyn Bienvenu,Michaël Thomazo

RR, pp.1-17, (2016)

Cited by2EIBibtex

Inconsistency-Tolerant Querying of Description Logic Knowledge Bases.

Meghyn Bienvenu, Camille Bourgaux

Reasoning Web, pp.156-202, (2016)

Cited by2EIBibtex

Query and Predicate Emptiness in Ontology-Based Data Access.

Franz Baader,Meghyn Bienvenu,Carsten Lutz,Frank Wolter

J. Artif. Intell. Res. (JAIR), (2016): 1-59

Cited by23EIBibtex

Explaining Inconsistency-Tolerant Query Answering over Description Logic Knowledge Bases.

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

AAAI, pp.900-906, (2016)

Cited by23EIBibtex

Meghyn Bienvenu,Peter Hansen 0002,Carsten Lutz,Frank Wolter

Description Logics, (2016)

Cited by40EIBibtex

Query-Based Comparison of Mappings in Ontology-Based Data Access.

Query-driven Repairing of Inconsistent DL-Lite Knowledge Bases (Extended Abstract).

KR, pp.197-206, (2016)

Cited by4EIBibtex

What if Machines Could be Creative?

Description Logics, (2016)

Cited by10EIBibtex

Fabian M. Suchanek, Colette Menard,Meghyn Bienvenu, Cyril Chapellier

International Semantic Web Conference (Posters & Demos), (2016)

EIBibtex

Combined Complexity of Answering Tree-like Queries in OWL 2 QL.

Meghyn Bienvenu,Stanislav Kikot,Vladimir V. Podolskii

Description Logics, (2015)

EIBibtex

Explaining Query Answers under Inconsistency-Tolerant Semantics over Description Logic Knowledge Bases (Extended Abstract).

Query-based comparison of OBDA specifications.

Description Logics, (2015)

Cited by3EIBibtex

Ontology-Mediated Query Answering with Data-Tractable Description Logics

Description Logics, (2015)

Cited by11EIBibtex

Meghyn Bienvenu,Magdalena Ortiz

Reasoning Web, (2015)

Cited by52EIBibtex

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

Meghyn Bienvenu,Stanislav Kikot,Vladimir V. Podolskii

LICS, pp.317-328, (2015)

Cited by12EIWOSBibtex

Navigational Queries Based on Frontier-Guarded Datalog: Preliminary Results.

Meghyn Bienvenu,Magdalena Ortiz,Mantas Simkus

AMW, (2015)

Cited by6EIBibtex

Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms

Meghyn Bienvenu,Magdalena Ortiz,Mantas Simkus

Journal of Artificial Intelligence Research, no. 1 (2015)

Cited by12EIBibtex

Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP

Meghyn Bienvenu,Balder ten Cate,Carsten Lutz,Frank Wolter

international conference on management of data, no. 4 (2014)

Cited by137EIBibtex

Nested Regular Path Queries in Description Logics.

Meghyn Bienvenu,Diego Calvanese,Magdalena Ortiz,Mantas Simkus

KR, (2014)

Cited by37EIBibtex

Nested Regular Path Queries in Description Logics (Extended Abstract).

Meghyn Bienvenu,Diego Calvanese,Magdalena Ortiz,Mantas Simkus

AMW, (2014)

Cited by29EIBibtex

Tractable approximations of consistent query answering for robust ontology-based data access

First-order rewritability of atomic queries in horn description logics

IJCAI, pp.775-781, (2013)

Cited by75EIBibtex

Meghyn Bienvenu,Carsten Lutz,Frank Wolter

IJCAI, pp.754-760, (2013)

Cited by46EIBibtex

Tractability Guarantees for DL-Lite Query Answering.

Meghyn Bienvenu,Magdalena Ortiz,Mantas Simkus,Guohui Xiao

Description Logics, pp.41-52, (2013)

EIBibtex

Deduction in the Presence of Distribution and Contradictions ∗

Serge Abiteboul,Meghyn Bienvenu,Daniel Deutch

(2013)

Cited by1Bibtex

Conjunctive regular path queries in lightweight description logics

Meghyn Bienvenu,Magdalena Ortiz,Mantas Šimkus

IJCAI, pp.761-767, (2013)

Cited by23EIBibtex

Tractable queries for lightweight description logics

Meghyn Bienvenu,Magdalena Ortiz,Mantas Šimkus,Guohui Xiao

IJCAI, pp.768-774, (2013)

Cited by34EIBibtex

New Inconsistency-Tolerant Semantics for Robust Ontology-Based Data Access.

Answering Expressive Path Queries over Lightweight DL Knowledge Bases.

Description Logics, (2013): 53-64

Cited by14EIBibtex

Meghyn Bienvenu,Magdalena Ortiz,Mantas Simkus

Description Logics, (2012)

Cited by8EIBibtex

Query Containment in Description Logics Reconsidered.

Meghyn Bienvenu,Carsten Lutz,Frank Wolter

KR, (2012)

Cited by32EIBibtex

On the Complexity of Consistent Query Answering in the Presence of Simple Ontologies.

Provenance for Web 2.0 Data.

AAAI, (2012)

Cited by71EIBibtex

Meghyn Bienvenu,Daniel Deutch,Fabian M. Suchanek

Secure Data Management, pp.148-155, (2012)

Cited by3EIBibtex

Inconsistency-Tolerant Conjunctive Query Answering for Simple Ontologies.

Deduction in the Presence of Distribution and Contradictions.

Description Logics, (2012)

Cited by13EIBibtex

Serge Abiteboul,Meghyn Bienvenu,Daniel Deutch

WebDB, pp.31-36, (2012)

Cited by1EIBibtex

Dealing with the Deep Web and all its Quirks.

Meghyn Bienvenu,Daniel Deutch,Davide Martinenghi,Pierre Senellart,Fabian M. Suchanek

VLDS, pp.21-24, (2012)

Cited by4EIBibtex

Deciding FO-Rewritability in EL.

Meghyn Bienvenu, Carsten Lutz,Frank Wolter

Description Logics, (2012)

Cited by11EIBibtex

Specifying and computing preferred plans

Meghyn Bienvenu,Christian Fritz,Sheila A. McIlraith

Artif. Intell., no. 7-8 (2011): 1308-1345

Cited by22EIBibtex

A rule-based language for web data management

Serge Abiteboul,Meghyn Bienvenu,Alban Galland,Émilien Antoine

PODS, pp.293-304, (2011)

Cited by67EIBibtex

First-Order Expressibility Results for Queries over Inconsistent DL-Lite Knowledge Bases.

Knowledge Compilation in the Modal Logic S5

Description Logics, (2011)

Cited by11EIBibtex

Meghyn Bienvenu,Hélène Fargier,Pierre Marquis

AAAI, (2010)

Cited by15EIBibtex

From Preference Logics to Preference Languages, and Back

Meghyn Bienvenu,Jérôme Lang,Nic Wilson

KR, (2010)

Cited by60EIBibtex

Query and Predicate Emptiness in Description Logics

Franz Baader,Meghyn Bienvenu, Carsten Lutz,Frank Wolter

KR, (2010)

Cited by28EIBibtex

Query Answering in the Description Logic S.

Meghyn Bienvenu,Thomas Eiter,Carsten Lutz,Magdalena Ortiz,Mantas Simkus

Description Logics, (2010)

Cited by6EIBibtex

Distributed datalog revisited

Serge Abiteboul,Meghyn Bienvenu,Alban Galland,Marie-Christine Rousset

Datalog, pp.252-261, (2010)

Cited by6EIBibtex

Prime implicates and prime implicants: from propositional to modal logic

Query Answering over DL ABoxes: How to Pick the Relevant Symbols

Journal of Artificial Intelligence Research, no. 1 (2009): 71-128

Cited by8EIBibtex

Franz Baader,Meghyn Bienvenu,Carsten Lutz,Frank Wolter

Description Logics, (2009)

Cited by4EIBibtex

Complexity of Abduction in the EL Family of Lightweight Description Logics

Beyond classical planning: procedural control knowledge and preferences in state-of-the-art planners

KR, pp.220-230, (2008)

Cited by41EIBibtex

Jorge A. Baier,Christian Fritz,Meghyn Bienvenu,Sheila A McIlraith

AAAI, pp.1509-1512, (2008)

Cited by23EIBibtex

Prime Implicate-based Belief Revision Operators

Meghyn Bienvenu,Andreas Herzig,Guilin Qi

ECAI, pp.741-742, (2008)

Cited by38EIBibtex

Prime Implicate Normal Form for ALC Concepts

Prime implicates and prime implicants in modal logic

AAAI, pp.412-417, (2008)

Cited by14EIBibtex

Consequence Finding in ALC

AAAI, pp.379-384, (2007)

Cited by18EIBibtex

Planning with Qualitative Temporal Preferences

Description Logics, (2007)

Cited by6EIBibtex

Meghyn Bienvenu,Christian Fritz,Sheila A. Mcilraith

KR, pp.134-144, (2006)

Cited by104EIBibtex

Qualitative dynamical preferences in the situation calculus

M Bienvenu, S McIlraith

Cited by5Bibtex

Prime Implicates and Prime Implicants in Modal Logic: Extended and Revised Version