Planning with Qualitative Temporal Preferences. - Meghyn Bienvenu; Christian Fritz 001; Sheila A. McIlraith (KR, 2006)

Prime Implicates and Prime Implicants in Modal Logic. - Meghyn Bienvenu (AAAI, 2007)

Consequence Finding in ALC. - Meghyn Bienvenu (Description Logics, 2007)

Beyond Classical Planning: Procedural Control Knowledge and Preferences in State-of-the-Art Planners. - Jorge A. Baier; Christian Fritz 001; Meghyn Bienvenu; Sheila A. McIlraith (AAAI, 2008)

Prime Implicate Normal Form for ALC Concepts. - Meghyn Bienvenu (AAAI, 2008)

Prime Implicate-based Belief Revision Operators. - Meghyn Bienvenu; Andreas Herzig; Guilin Qi (ECAI, 2008)

Complexity of Abduction in the EL Family of Lightweight Description Logics. - Meghyn Bienvenu (KR, 2008)

Query Answering over DL ABoxes: How to Pick the Relevant Symbols. - Franz Baader; Meghyn Bienvenu; Carsten Lutz; Frank Wolter (Description Logics, 2009)

Prime Implicates and Prime Implicants: From Propositional to Modal Logic. - Meghyn Bienvenu (J. Artif. Intell. Res., 2009)

Knowledge Compilation in the Modal Logic S5. - Meghyn Bienvenu; Hélène Fargier; Pierre Marquis (AAAI, 2010)

Distributed Datalog Revisited. - Serge Abiteboul; Meghyn Bienvenu; Alban Galland; Marie-Christine Rousset (Datalog, 2010)

Query Answering in the Description Logic S. - Meghyn Bienvenu; Thomas Eiter; Carsten Lutz; Magdalena Ortiz 001; Mantas Simkus (Description Logics, 2010)

Query and Predicate Emptiness in Description Logics. - Franz Baader; Meghyn Bienvenu; Carsten Lutz; Frank Wolter (KR, 2010)

From Preference Logics to Preference Languages, and Back. - Meghyn Bienvenu; Jérôme Lang; Nic Wilson (KR, 2010)

First-Order Expressibility Results for Queries over Inconsistent DL-Lite Knowledge Bases. - Meghyn Bienvenu (Description Logics, 2011)

A rule-based language for web data management. - Serge Abiteboul; Meghyn Bienvenu; Alban Galland; Émilien Antoine (PODS, 2011)

Specifying and computing preferred plans. - Meghyn Bienvenu; Christian Fritz 001; Sheila A. McIlraith (Artif. Intell., 2011)

On the Complexity of Consistent Query Answering in the Presence of Simple Ontologies. - Meghyn Bienvenu (AAAI, 2012)

Inconsistency-Tolerant Conjunctive Query Answering for Simple Ontologies. - Meghyn Bienvenu (Description Logics, 2012)

Deciding FO-Rewritability in EL. - Meghyn Bienvenu; Carsten Lutz; Frank Wolter (Description Logics, 2012)

Answering Expressive Path Queries over Lightweight DL Knowledge Bases. - Meghyn Bienvenu; Magdalena Ortiz 001; Mantas Simkus (Description Logics, 2012)

Query Containment in Description Logics Reconsidered. - Meghyn Bienvenu; Carsten Lutz; Frank Wolter (KR, 2012)

Provenance for Web 2.0 Data. - Meghyn Bienvenu; Daniel Deutch; Fabian M. Suchanek (Secure Data Management, 2012)

Dealing with the Deep Web and all its Quirks. - Meghyn Bienvenu; Daniel Deutch; Davide Martinenghi; Pierre Senellart; Fabian M. Suchanek (VLDS, 2012)

Deduction in the Presence of Distribution and Contradictions. - Serge Abiteboul; Meghyn Bienvenu; Daniel Deutch (WebDB, 2012)

Tractability Guarantees for DL-Lite Query Answering. - Meghyn Bienvenu; Magdalena Ortiz 001; Mantas Simkus; Guohui Xiao 001 (Description Logics, 2013)

New Inconsistency-Tolerant Semantics for Robust Ontology-Based Data Access. - Meghyn Bienvenu; Riccardo Rosati 001 (Description Logics, 2013)

First-Order Rewritability of Atomic Queries in Horn Description Logics. - Meghyn Bienvenu; Carsten Lutz; Frank Wolter (IJCAI, 2013)

Conjunctive Regular Path Queries in Lightweight Description Logics. - Meghyn Bienvenu; Magdalena Ortiz 001; Mantas Simkus (IJCAI, 2013)

Tractable Queries for Lightweight Description Logics. - Meghyn Bienvenu; Magdalena Ortiz 001; Mantas Simkus; Guohui Xiao 001 (IJCAI, 2013)

Tractable Approximations of Consistent Query Answering for Robust Ontology-based Data Access. - Meghyn Bienvenu; Riccardo Rosati 001 (IJCAI, 2013)

Querying Inconsistent Description Logic Knowledge Bases under Preferred Repair Semantics. - Meghyn Bienvenu; Camille Bourgaux; François Goasdoué (AAAI, 2014)

Nested Regular Path Queries in Description Logics (Extended Abstract). - Meghyn Bienvenu; Diego Calvanese; Magdalena Ortiz 001; Mantas Simkus (AMW, 2014)

Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries. - Meghyn Bienvenu; Stanislav Kikot; Vladimir V. Podolskii (Description Logics, 2014)

Nested Regular Path Queries in Description Logics. - Meghyn Bienvenu; Diego Calvanese; Magdalena Ortiz 001; Mantas Simkus (KR, 2014)

Ontology-Based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP. - Meghyn Bienvenu; Balder ten Cate; Carsten Lutz; Frank Wolter (ACM Trans. Database Syst., 2014)

Navigational Queries Based on Frontier-Guarded Datalog: Preliminary Results. - Meghyn Bienvenu; Magdalena Ortiz 001; Mantas Simkus (AMW, 2015)

Explaining Query Answers under Inconsistency-Tolerant Semantics over Description Logic Knowledge Bases (Extended Abstract). - Meghyn Bienvenu; Camille Bourgaux; François Goasdoué (Description Logics, 2015)

Combined Complexity of Answering Tree-like Queries in OWL 2 QL. - Meghyn Bienvenu; Stanislav Kikot; Vladimir V. Podolskii (Description Logics, 2015)

Query-based comparison of OBDA specifications. - Meghyn Bienvenu; Riccardo Rosati 001 (Description Logics, 2015)

Combining Existential Rules and Transitivity: Next Steps. - Jean-François Baget; Meghyn Bienvenu; Marie-Laure Mugnier; Swan Rocher (IJCAI, 2015)

Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results. - Meghyn Bienvenu; Stanislav Kikot; Vladimir V. Podolskii (LICS, 2015)

Ontology-Mediated Query Answering with Data-Tractable Description Logics. - Meghyn Bienvenu; Magdalena Ortiz 001 (Reasoning Web, 2015)

Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms. - Meghyn Bienvenu; Magdalena Ortiz 001; Mantas Simkus (J. Artif. Intell. Res., 2015)

Explaining Inconsistency-Tolerant Query Answering over Description Logic Knowledge Bases. - Meghyn Bienvenu; Camille Bourgaux; François Goasdoué (AAAI, 2016)

Query-driven Repairing of Inconsistent DL-Lite Knowledge Bases (Extended Abstract). - Meghyn Bienvenu; Camille Bourgaux; François Goasdoué (Description Logics, 2016)

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)

First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics. - Meghyn Bienvenu; Peter Hansen 002; Carsten Lutz; Frank Wolter (IJCAI, 2016)

Ontology-Mediated Query Answering: Harnessing Knowledge to Get More from Data. - Meghyn Bienvenu (IJCAI, 2016)

Query-Driven Repairing of Inconsistent DL-Lite Knowledge Bases. - Meghyn Bienvenu; Camille Bourgaux; François Goasdoué (IJCAI, 2016)

Query-Based Comparison of Mappings in Ontology-Based Data Access. - Meghyn Bienvenu; Riccardo Rosati 001 (KR, 2016)

On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules. - Meghyn Bienvenu; Michaël Thomazo (RR, 2016)

Inconsistency-Tolerant Querying of Description Logic Knowledge Bases. - Meghyn Bienvenu; Camille Bourgaux (RW, 2016)

What if Machines Could be Creative? - Fabian M. Suchanek; Colette Menard; Meghyn Bienvenu; Cyril Chapellier (ISWC (Posters & Demos), 2016)

Can You Imagine... A Language for Combinatorial Creativity? - Fabian M. Suchanek; Colette Menard; Meghyn Bienvenu; Cyril Chapellier (ISWC (1), 2016)

Query and Predicate Emptiness in Ontology-Based Data Access. - Franz Baader; Meghyn Bienvenu; Carsten Lutz; Frank Wolter (J. Artif. Intell. Res., 2016)

Research Directions for Principles of Data Management (Abridged). - Serge Abiteboul; Marcelo Arenas; Pablo Barceló; Meghyn Bienvenu; Diego Calvanese; Claire David; Richard Hull 001; Eyke Hüllermeier; Benny Kimelfeld; Leonid Libkin; Wim Martens; Tova Milo; et al. (SIGMOD Rec., 2016)

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)

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)

Answering Conjunctive Regular Path Queries over Guarded Existential Rules. - Jean-François Baget; Meghyn Bienvenu; Marie-Laure Mugnier; Michaël Thomazo (IJCAI, 2017)

Ontology-Mediated Query Answering for Key-Value Stores. - Meghyn Bienvenu; Pierre Bourhis; Marie-Laure Mugnier; Sophie Tison; Federico Ulliana (IJCAI, 2017)

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)

Inconsistency-Tolerant Ontology-Based Data Access Revisited: Taking Mappings into Account. - Meghyn Bienvenu (IJCAI, 2018)

Finite LTL Synthesis with Environment Assumptions and Quality Measures. - Alberto Camacho; Meghyn Bienvenu; Sheila A. McIlraith (KR, 2018)

Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151). - Serge Abiteboul; Marcelo Arenas; Pablo Barceló; Meghyn Bienvenu; Diego Calvanese; Claire David; Richard Hull 001; Eyke Hüllermeier; Benny Kimelfeld; Leonid Libkin; Wim Martens; Tova Milo; et al. (Dagstuhl Manifestos, 2018)

Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity. - Meghyn Bienvenu; Stanislav Kikot; Roman Kontchakov; Vladimir V. Podolskii; Michael Zakharyaschev (J. ACM, 2018)

Towards a Unified View of AI Planning and Reactive Synthesis. - Alberto Camacho; Meghyn Bienvenu; Sheila A. McIlraith (ICAPS, 2019)

Inconsistency Handling in Ontology-Mediated Query Answering: A Progress Report. - Meghyn Bienvenu (Description Logics, 2019)

Mixed-World Reasoning with Existential Rules under Active Domain Semantics (Abstract). - Meghyn Bienvenu; Pierre Bourhis (Description Logics, 2019)

Mixed-World Reasoning with Existential Rules under Active-Domain Semantics. - Meghyn Bienvenu; Pierre Bourhis (IJCAI, 2019)

Computing and Explaining Query Answers over Inconsistent DL-Lite Knowledge Bases. - Meghyn Bienvenu; Camille Bourgaux; François Goasdoué (J. Artif. Intell. Res., 2019)

Reasoning with Ontologies. - Meghyn Bienvenu; Michel Leclère; Marie-Laure Mugnier; Marie-Christine Rousset (A Guided Tour of Artificial Intelligence Research (1) (I), 2020)

Answering Counting Queries over DL-Lite Ontologies (Extended Abstract). - Meghyn Bienvenu; Quentin Manière; Michaël Thomazo (Description Logics, 2020)

Answering Counting Queries over DL-Lite Ontologies. - Meghyn Bienvenu; Quentin Manière; Michaël Thomazo (IJCAI, 2020)

Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation. - Meghyn Bienvenu; Camille Bourgaux (KR, 2020)

A Short Survey on Inconsistency Handling in Ontology-Mediated Query Answering. - Meghyn Bienvenu (Künstliche Intell., 2020)

Cardinality Queries over DL-Lite Ontologies (Extended abstract). - Meghyn Bienvenu; Quentin Manière; Michaël Thomazo (Description Logics, 2021)

Cardinality Queries over DL-Lite Ontologies. - Meghyn Bienvenu; Quentin Manière; Michaël Thomazo (IJCAI, 2021)

Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments (Extended Abstract). - Meghyn Bienvenu; Camille Bourgaux (Description Logics, 2022)

Complexity Landscape for Counting Queries (Extended Abstract). - Meghyn Bienvenu; Quentin Manière; Michaël Thomazo (Description Logics, 2022)

Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments. - Meghyn Bienvenu; Camille Bourgaux (KR, 2022)

Counting Queries over ELHI⊥ Ontologies. - Meghyn Bienvenu; Quentin Manière; Michaël Thomazo (KR, 2022)

LACE: A Logical Approach to Collective Entity Resolution. - Meghyn Bienvenu; Gianluca Cima; Víctor Gutiérrez-Basulto (PODS, 2022)

REPLACE: A Logical Framework for Combining Collective Entity Resolution and Repairing. - Meghyn Bienvenu; Gianluca Cima; Víctor Gutiérrez-Basulto (IJCAI, 2023)

Inconsistency Handling in Prioritized Databases with Universal Constraints: Complexity Analysis and Links with Active Integrity Constraints. - Meghyn Bienvenu; Camille Bourgaux (KR, 2023)

On Combining Collective Entity Resolution and Repairing (Extended Abstract). - Meghyn Bienvenu; Gianluca Cima; Víctor Gutiérrez-Basulto (ENIGMA@KR, 2023)

Combining Global and Local Merges in Logic-based Entity Resolution. - Meghyn Bienvenu; Gianluca Cima; Víctor Gutiérrez-Basulto; Yazmín Ibáñez-García (KR, 2023)

Cost-Based Semantics for Querying Inconsistent Weighted Knowledge Bases. - Meghyn Bienvenu; Camille Bourgaux; Robin Jean (KR, 2024)

Queries With Exact Truth Values in Paraconsistent Description Logics. - Meghyn Bienvenu; Camille Bourgaux; Daniil Kozhemiachenko (KR, 2024)

Shapley Value Computation in Ontology-Mediated Query Answering. - Meghyn Bienvenu; Diego Figueira; Pierre Lafourcade (KR, 2024)

Abductive Reasoning in a Paraconsistent Framework. - Meghyn Bienvenu; Katsumi Inoue; Daniil Kozhemiachenko (KR, 2024)

ASPEN: ASP-Based System for Collective Entity Resolution. - Zhiliang Xiang; Meghyn Bienvenu; Gianluca Cima; Víctor Gutiérrez-Basulto; Yazmín Ibáñez-García (KR, 2024)

When is Shapley Value Computation a Matter of Counting? - Meghyn Bienvenu; Diego Figueira; Pierre Lafourcade (Proc. ACM Manag. Data, 2024)

Ontology-driven identification of inconsistencies in clinical data: A case study in lung cancer phenotyping. - Yvon K. Awuklu; Fleur Mougin; Romain Griffier; Meghyn Bienvenu; Vianney Jouhet (J. Biomed. Informatics, 2025)

Inconsistency Handling in DatalogMTL. - Meghyn Bienvenu; Camille Bourgaux; Atefe Khodadaditaghanaki (CoRR, 2025)

Shapley Revisited: Tractable Responsibility Measures for Query Answers. - Meghyn Bienvenu; Diego Figueira; Pierre Lafourcade (Proc. ACM Manag. Data, 2025)

Tractable Responsibility Measures for Ontology-Mediated Query Answering. - Meghyn Bienvenu; Diego Figueira; Pierre Lafourcade (CoRR, 2025)

A Rule-Based Approach to Specifying Preferences over Conflicting Facts and Querying Inconsistent Knowledge Bases. - Meghyn Bienvenu; Camille Bourgaux; Katsumi Inoue; Robin Jean (CoRR, 2025)

Advances in Logic-Based Entity Resolution: Enhancing ASPEN with Local Merges and Optimality Criteria. - Zhliang Xiang; Meghyn Bienvenu; Gianluca Cima; Víctor Gutiérrez-Basulto; Yazmín Ibáñez-García (CoRR, 2025)