default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMeghyn Bienvenu
Person information
- affiliation: University Bordeaux, CNRS, France
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j11]Meghyn Bienvenu
, Diego Figueira, Pierre Lafourcade:
When is Shapley Value Computation a Matter of Counting? Proc. ACM Manag. Data 2(2): 105 (2024)- [c87]Meghyn Bienvenu, Camille Bourgaux, Robin Jean:
Cost-Based Semantics for Querying Inconsistent Weighted Knowledge Bases. KR 2024 - [c86]Meghyn Bienvenu, Camille Bourgaux, Daniil Kozhemiachenko:
Queries With Exact Truth Values in Paraconsistent Description Logics. KR 2024 - [c85]Meghyn Bienvenu, Diego Figueira, Pierre Lafourcade:
Shapley Value Computation in Ontology-Mediated Query Answering. KR 2024 - [c84]Meghyn Bienvenu, Katsumi Inoue, Daniil Kozhemiachenko:
Abductive Reasoning in a Paraconsistent Framework. KR 2024 - [c83]Zhiliang Xiang, Meghyn Bienvenu, Gianluca Cima, Víctor Gutiérrez-Basulto, Yazmín Ibáñez-García:
ASPEN: ASP-Based System for Collective Entity Resolution. KR 2024 - [i22]Meghyn Bienvenu, Diego Figueira, Pierre Lafourcade:
Shapley Value Computation in Ontology-Mediated Query Answering. CoRR abs/2407.20058 (2024) - [i21]Meghyn Bienvenu, Camille Bourgaux, Robin Jean:
Cost-Based Semantics for Querying Inconsistent Weighted Knowledge Bases. CoRR abs/2407.20754 (2024) - [i20]Zhiliang Xiang, Meghyn Bienvenu, Gianluca Cima, Víctor Gutiérrez-Basulto, Yazmín Ibáñez-García:
ASPEN: ASP-Based System for Collective Entity Resolution. CoRR abs/2408.06961 (2024) - [i19]Meghyn Bienvenu, Camille Bourgaux, Daniil Kozhemiachenko:
Queries With Exact Truth Values in Paraconsistent Description Logics. CoRR abs/2408.07283 (2024) - [i18]Meghyn Bienvenu, Katsumi Inoue, Daniil Kozhemiachenko:
Abductive Reasoning in a Paraconsistent Framework. CoRR abs/2408.07287 (2024) - 2023
- [c82]Meghyn Bienvenu, Gianluca Cima, Víctor Gutiérrez-Basulto:
REPLACE: A Logical Framework for Combining Collective Entity Resolution and Repairing. IJCAI 2023: 3132-3139 - [c81]Meghyn Bienvenu, Gianluca Cima, Víctor Gutiérrez-Basulto:
On Combining Collective Entity Resolution and Repairing (Extended Abstract). ENIGMA@KR 2023: 93-95 - [c80]Meghyn Bienvenu, Camille Bourgaux:
Inconsistency Handling in Prioritized Databases with Universal Constraints: Complexity Analysis and Links with Active Integrity Constraints. KR 2023: 97-106 - [c79]Meghyn Bienvenu, Gianluca Cima, Víctor Gutiérrez-Basulto, Yazmín Ibáñez-García:
Combining Global and Local Merges in Logic-based Entity Resolution. KR 2023: 742-746 - [i17]Meghyn Bienvenu, Gianluca Cima, Víctor Gutiérrez-Basulto, Yazmín Ibáñez-García:
Combining Global and Local Merges in Logic-based Entity Resolution. CoRR abs/2305.16926 (2023) - [i16]Meghyn Bienvenu, Camille Bourgaux:
Inconsistency Handling in Prioritized Databases with Universal Constraints: Complexity Analysis and Links with Active Integrity Constraints. CoRR abs/2306.03523 (2023) - [i15]Meghyn Bienvenu, Diego Figueira, Pierre Lafourcade:
When is Shapley Value Computation a Matter of Counting? CoRR abs/2312.14529 (2023) - 2022
- [c78]Meghyn Bienvenu, Camille Bourgaux:
Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments (Extended Abstract). Description Logics 2022 - [c77]Meghyn Bienvenu, Quentin Manière, Michaël Thomazo:
Complexity Landscape for Counting Queries (Extended Abstract). Description Logics 2022 - [c76]Meghyn Bienvenu, Camille Bourgaux:
Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments. KR 2022 - [c75]Meghyn Bienvenu, Quentin Manière, Michaël Thomazo:
Counting Queries over ELHI⊥ Ontologies. KR 2022 - [c74]Meghyn Bienvenu, Gianluca Cima, Víctor Gutiérrez-Basulto:
LACE: A Logical Approach to Collective Entity Resolution. PODS 2022: 379-391 - [i14]Meghyn Bienvenu, Camille Bourgaux:
Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments. CoRR abs/2202.07980 (2022) - 2021
- [c73]Meghyn Bienvenu, Quentin Manière, Michaël Thomazo:
Counting Queries over ELHI⊥ Ontologies. Description Logics 2021 - [c72]Meghyn Bienvenu, Quentin Manière, Michaël Thomazo:
Cardinality Queries over DL-Lite Ontologies (Extended abstract). Description Logics 2021 - [c71]Meghyn Bienvenu, Quentin Manière, Michaël Thomazo:
Cardinality Queries over DL-Lite Ontologies. IJCAI 2021: 1801-1807 - [e2]Meghyn Bienvenu, Gerhard Lakemeyer, Esra Erdem:
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, KR 2021, Online event, November 3-12, 2021. 2021, ISBN 978-1-956792-99-7 [contents] - 2020
- [j10]Meghyn Bienvenu:
A Short Survey on Inconsistency Handling in Ontology-Mediated Query Answering. Künstliche Intell. 34(4): 443-451 (2020) - [c70]Meghyn Bienvenu, Quentin Manière, Michaël Thomazo:
Answering Counting Queries over DL-Lite Ontologies (Extended Abstract). Description Logics 2020 - [c69]Meghyn Bienvenu, Quentin Manière, Michaël Thomazo:
Answering Counting Queries over DL-Lite Ontologies. IJCAI 2020: 1608-1614 - [c68]Meghyn Bienvenu, Camille Bourgaux:
Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation. KR 2020: 141-151 - [p1]Meghyn Bienvenu, Michel Leclère, Marie-Laure Mugnier, Marie-Christine Rousset:
Reasoning with Ontologies. A Guided Tour of Artificial Intelligence Research (1) (I) 2020: 185-215 - [i13]Meghyn Bienvenu, Camille Bourgaux:
Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation. CoRR abs/2003.05746 (2020) - [i12]Meghyn Bienvenu, Quentin Manière, Michaël Thomazo:
Answering Counting Queries over DL-Lite Ontologies. CoRR abs/2009.09801 (2020) - [i11]Meghyn Bienvenu, Peter Hansen, Carsten Lutz, Frank Wolter:
First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics. CoRR abs/2011.09836 (2020)
2010 – 2019
- 2019
- [j9]Meghyn Bienvenu, Camille Bourgaux, François Goasdoué:
Computing and Explaining Query Answers over Inconsistent DL-Lite Knowledge Bases. J. Artif. Intell. Res. 64: 563-644 (2019) - [c67]Alberto Camacho, Meghyn Bienvenu, Sheila A. McIlraith:
Towards a Unified View of AI Planning and Reactive Synthesis. ICAPS 2019: 58-67 - [c66]Meghyn Bienvenu:
Inconsistency Handling in Ontology-Mediated Query Answering: A Progress Report. Description Logics 2019 - [c65]Meghyn Bienvenu, Pierre Bourhis:
Mixed-World Reasoning with Existential Rules under Active Domain Semantics (Abstract). Description Logics 2019 - [c64]Meghyn Bienvenu, Pierre Bourhis:
Mixed-World Reasoning with Existential Rules under Active-Domain Semantics. IJCAI 2019: 1558-1565 - 2018
- [j8]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, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu, Ke Yi:
Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151). Dagstuhl Manifestos 7(1): 1-29 (2018) - [j7]Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev:
Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity. J. ACM 65(5): 28:1-28:51 (2018) - [c63]Meghyn Bienvenu:
Inconsistency-Tolerant Ontology-Based Data Access Revisited: Taking Mappings into Account. Description Logics 2018 - [c62]Meghyn Bienvenu:
Inconsistency-Tolerant Ontology-Based Data Access Revisited: Taking Mappings into Account. IJCAI 2018: 1721-1729 - [c61]Alberto Camacho, Meghyn Bienvenu, Sheila A. McIlraith:
Finite LTL Synthesis with Environment Assumptions and Quality Measures. KR 2018: 454-463 - [i10]Alberto Camacho, Meghyn Bienvenu, Sheila A. McIlraith:
Finite LTL Synthesis with Environment Assumptions and Quality Measures. CoRR abs/1808.10831 (2018) - 2017
- [c60]Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev:
On the Parametrised Complexity of Tree-Shaped Ontology-Mediated Queries in OWL 2 QL. Description Logics 2017 - [c59]Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev:
Optimal Nonrecursive Datalog Rewritings of Linear TGDs and Bounded (Hyper)Tree-Width Queries. Description Logics 2017 - [c58]Jean-François Baget, Meghyn Bienvenu, Marie-Laure Mugnier, Michaël Thomazo:
Answering Conjunctive Regular Path Queries over Guarded Existential Rules. IJCAI 2017: 793-799 - [c57]Meghyn Bienvenu, Pierre Bourhis, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana:
Ontology-Mediated Query Answering for Key-Value Stores. IJCAI 2017: 844-851 - [c56]Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Vladislav Ryzhikov, Michael Zakharyaschev:
The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries. PODS 2017: 201-216 - [i9]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, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu, Ke Yi:
Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151). CoRR abs/1701.09007 (2017) - [i8]Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Vladislav Ryzhikov, Michael Zakharyaschev:
The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries. CoRR abs/1702.03358 (2017) - 2016
- [j6]Franz Baader, Meghyn Bienvenu, Carsten Lutz, Frank Wolter:
Query and Predicate Emptiness in Ontology-Based Data Access. J. Artif. Intell. Res. 56: 1-59 (2016) - [j5]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, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu, Ke Yi:
Research Directions for Principles of Data Management (Abridged). SIGMOD Rec. 45(4): 5-17 (2016) - [c55]Meghyn Bienvenu, Camille Bourgaux, François Goasdoué:
Explaining Inconsistency-Tolerant Query Answering over Description Logic Knowledge Bases. AAAI 2016: 900-906 - [c54]Meghyn Bienvenu, Peter Hansen, Carsten Lutz, Frank Wolter:
First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics. Description Logics 2016 - [c53]Meghyn Bienvenu, Camille Bourgaux, François Goasdoué:
Query-driven Repairing of Inconsistent DL-Lite Knowledge Bases (Extended Abstract). Description Logics 2016 - [c52]Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev:
Theoretically Optimal Datalog Rewritings for OWL 2 QL Ontology-Mediated Queries. Description Logics 2016 - [c51]Meghyn Bienvenu, Camille Bourgaux, François Goasdoué:
Query-Driven Repairing of Inconsistent DL-Lite Knowledge Bases. IJCAI 2016: 957-964 - [c50]Meghyn Bienvenu, Peter Hansen, Carsten Lutz, Frank Wolter:
First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics. IJCAI 2016: 965-971 - [c49]Meghyn Bienvenu:
Ontology-Mediated Query Answering: Harnessing Knowledge to Get More from Data. IJCAI 2016: 4058-4061 - [c48]Meghyn Bienvenu, Riccardo Rosati:
Query-Based Comparison of Mappings in Ontology-Based Data Access. KR 2016: 197-206 - [c47]Meghyn Bienvenu, Michaël Thomazo:
On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules. RR 2016: 1-17 - [c46]Meghyn Bienvenu, Camille Bourgaux:
Inconsistency-Tolerant Querying of Description Logic Knowledge Bases. RW 2016: 156-202 - [c45]Fabian M. Suchanek, Colette Menard, Meghyn Bienvenu, Cyril Chapellier:
What if Machines Could be Creative? ISWC (Posters & Demos) 2016 - [c44]Fabian M. Suchanek, Colette Menard, Meghyn Bienvenu, Cyril Chapellier:
Can You Imagine... A Language for Combinatorial Creativity? ISWC (1) 2016: 532-548 - [i7]Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev:
Theoretically Optimal Datalog Rewritings for OWL 2 QL Ontology-Mediated Queries. CoRR abs/1604.05258 (2016) - [i6]Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev:
Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity. CoRR abs/1605.01207 (2016) - 2015
- [j4]Meghyn Bienvenu, Magdalena Ortiz, Mantas Simkus:
Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms. J. Artif. Intell. Res. 53: 315-374 (2015) - [c43]Meghyn Bienvenu, Magdalena Ortiz, Mantas Simkus:
Navigational Queries Based on Frontier-Guarded Datalog: Preliminary Results. AMW 2015 - [c42]Meghyn Bienvenu, Camille Bourgaux, François Goasdoué:
Explaining Query Answers under Inconsistency-Tolerant Semantics over Description Logic Knowledge Bases (Extended Abstract). Description Logics 2015 - [c41]Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii:
Combined Complexity of Answering Tree-like Queries in OWL 2 QL. Description Logics 2015 - [c40]Meghyn Bienvenu, Riccardo Rosati:
Query-based comparison of OBDA specifications. Description Logics 2015 - [c39]Jean-François Baget, Meghyn Bienvenu, Marie-Laure Mugnier, Swan Rocher:
Combining Existential Rules and Transitivity: Next Steps. IJCAI 2015: 2720-2726 - [c38]Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii:
Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results. LICS 2015: 317-328 - [c37]Meghyn Bienvenu, Magdalena Ortiz:
Ontology-Mediated Query Answering with Data-Tractable Description Logics. Reasoning Web 2015: 218-307 - [i5]Jean-François Baget, Meghyn Bienvenu, Marie-Laure Mugnier, Swan Rocher:
Combining Existential Rules and Transitivity: Next Steps. CoRR abs/1504.07443 (2015) - 2014
- [j3]Meghyn Bienvenu, Balder ten Cate, Carsten Lutz, Frank Wolter:
Ontology-Based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP. ACM Trans. Database Syst. 39(4): 33:1-33:44 (2014) - [c36]Meghyn Bienvenu, Camille Bourgaux, François Goasdoué:
Querying Inconsistent Description Logic Knowledge Bases under Preferred Repair Semantics. AAAI 2014: 996-1002 - [c35]Meghyn Bienvenu, Diego Calvanese, Magdalena Ortiz, Mantas Simkus:
Nested Regular Path Queries in Description Logics (Extended Abstract). AMW 2014 - [c34]Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii:
Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries. Description Logics 2014: 45-57 - [c33]Camille Bourgaux, Meghyn Bienvenu, François Goasdoué:
Querying Inconsistent Description Logic Knowledge Bases under Preferred Repair Semantics. Description Logics 2014: 96-99 - [c32]Meghyn Bienvenu, Diego Calvanese, Magdalena Ortiz, Mantas Simkus:
Nested Regular Path Queries in Description Logics. KR 2014 - [e1]Meghyn Bienvenu, Magdalena Ortiz, Riccardo Rosati, Mantas Simkus:
Informal Proceedings of the 27th International Workshop on Description Logics, Vienna, Austria, July 17-20, 2014. CEUR Workshop Proceedings 1193, CEUR-WS.org 2014 [contents] - [i4]Meghyn Bienvenu:
Prime Implicates and Prime Implicants: From Propositional to Modal Logic. CoRR abs/1401.3475 (2014) - [i3]Meghyn Bienvenu, Diego Calvanese, Magdalena Ortiz, Mantas Simkus:
Nested Regular Path Queries in Description Logics. CoRR abs/1402.7122 (2014) - [i2]Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii:
Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries. CoRR abs/1406.3047 (2014) - 2013
- [c31]Meghyn Bienvenu, Magdalena Ortiz, Mantas Simkus, Guohui Xiao:
Tractability Guarantees for DL-Lite Query Answering. Description Logics 2013: 41-52 - [c30]Meghyn Bienvenu, Riccardo Rosati:
New Inconsistency-Tolerant Semantics for Robust Ontology-Based Data Access. Description Logics 2013: 53-64 - [c29]Meghyn Bienvenu, Carsten Lutz, Frank Wolter:
First-Order Rewritability of Atomic Queries in Horn Description Logics. IJCAI 2013: 754-760 - [c28]Meghyn Bienvenu, Magdalena Ortiz, Mantas Simkus:
Conjunctive Regular Path Queries in Lightweight Description Logics. IJCAI 2013: 761-767 - [c27]Meghyn Bienvenu, Magdalena Ortiz, Mantas Simkus, Guohui Xiao:
Tractable Queries for Lightweight Description Logics. IJCAI 2013: 768-774 - [c26]Meghyn Bienvenu, Riccardo Rosati:
Tractable Approximations of Consistent Query Answering for Robust Ontology-based Data Access. IJCAI 2013: 775-781 - [c25]Meghyn Bienvenu, Balder ten Cate, Carsten Lutz, Frank Wolter:
Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP. PODS 2013: 213-224 - [i1]Meghyn Bienvenu, Balder ten Cate, Carsten Lutz, Frank Wolter:
Ontology-based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP. CoRR abs/1301.6479 (2013) - 2012
- [c24]Meghyn Bienvenu:
On the Complexity of Consistent Query Answering in the Presence of Simple Ontologies. AAAI 2012: 705-711 - [c23]Meghyn Bienvenu:
Inconsistency-Tolerant Conjunctive Query Answering for Simple Ontologies. Description Logics 2012 - [c22]Meghyn Bienvenu, Carsten Lutz, Frank Wolter:
Deciding FO-Rewritability in EL. Description Logics 2012 - [c21]Meghyn Bienvenu, Magdalena Ortiz, Mantas Simkus:
Answering Expressive Path Queries over Lightweight DL Knowledge Bases. Description Logics 2012 - [c20]Meghyn Bienvenu, Carsten Lutz, Frank Wolter:
Query Containment in Description Logics Reconsidered. KR 2012 - [c19]Meghyn Bienvenu, Daniel Deutch, Fabian M. Suchanek:
Provenance for Web 2.0 Data. Secure Data Management 2012: 148-155 - [c18]Meghyn Bienvenu, Daniel Deutch, Davide Martinenghi, Pierre Senellart, Fabian M. Suchanek:
Dealing with the Deep Web and all its Quirks. VLDS 2012: 21-24 - [c17]Serge Abiteboul, Meghyn Bienvenu, Daniel Deutch:
Deduction in the Presence of Distribution and Contradictions. WebDB 2012: 31-36 - 2011
- [j2]Meghyn Bienvenu, Christian Fritz, Sheila A. McIlraith:
Specifying and computing preferred plans. Artif. Intell. 175(7-8): 1308-1345 (2011) - [c16]Meghyn Bienvenu:
First-Order Expressibility Results for Queries over Inconsistent DL-Lite Knowledge Bases. Description Logics 2011 - [c15]Serge Abiteboul, Meghyn Bienvenu, Alban Galland, Émilien Antoine:
A rule-based language for web data management. PODS 2011: 293-304 - 2010
- [c14]Meghyn Bienvenu, Hélène Fargier, Pierre Marquis:
Knowledge Compilation in the Modal Logic S5. AAAI 2010: 261-266 - [c13]Serge Abiteboul, Meghyn Bienvenu, Alban Galland, Marie-Christine Rousset:
Distributed Datalog Revisited. Datalog 2010: 252-261 - [c12]Meghyn Bienvenu, Thomas Eiter, Carsten Lutz, Magdalena Ortiz, Mantas Simkus:
Query Answering in the Description Logic S. Description Logics 2010 - [c11]Franz Baader, Meghyn Bienvenu, Carsten Lutz, Frank Wolter:
Query and Predicate Emptiness in Description Logics. KR 2010 - [c10]Meghyn Bienvenu, Jérôme Lang, Nic Wilson:
From Preference Logics to Preference Languages, and Back. KR 2010
2000 – 2009
- 2009
- [j1]Meghyn Bienvenu:
Prime Implicates and Prime Implicants: From Propositional to Modal Logic. J. Artif. Intell. Res. 36: 71-128 (2009) - [c9]Franz Baader, Meghyn Bienvenu, Carsten Lutz, Frank Wolter:
Query Answering over DL ABoxes: How to Pick the Relevant Symbols. Description Logics 2009 - 2008
- [c8]Meghyn Bienvenu:
Prime Implicate Normal Form for ALC Concepts. AAAI 2008: 412-417 - [c7]Jorge A. Baier, Christian Fritz, Meghyn Bienvenu, Sheila A. McIlraith:
Beyond Classical Planning: Procedural Control Knowledge and Preferences in State-of-the-Art Planners. AAAI 2008: 1509-1512 - [c6]Meghyn Bienvenu:
Prime Implicate Normal Form for ALC Concepts. Description Logics 2008 - [c5]Meghyn Bienvenu, Andreas Herzig, Guilin Qi:
Prime Implicate-based Belief Revision Operators. ECAI 2008: 741-742 - [c4]Meghyn Bienvenu:
Complexity of Abduction in the EL Family of Lightweight Description Logics. KR 2008: 220-230 - 2007
- [c3]Meghyn Bienvenu:
Prime Implicates and Prime Implicants in Modal Logic. AAAI 2007: 379-384 - [c2]Meghyn Bienvenu:
Consequence Finding in ALC. Description Logics 2007 - 2006
- [c1]Meghyn Bienvenu, Christian Fritz, Sheila A. McIlraith:
Planning with Qualitative Temporal Preferences. KR 2006: 134-144
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-19 22:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
