Meghyn Bienvenu

MaRDI QIDQ646539zbMATH OpenDBLPORCIDWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Reasoning with ontologies	2024-09-11	Paper
Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP ACM Transactions on Database Systems	2021-11-25	Paper
Computing and explaining query answers over inconsistent DL-Lite knowledge bases Journal of Artificial Intelligence Research	2019-03-18	Paper
Ontology-mediated queries. Combined complexity and succinctness of rewritings via circuit complexity Journal of the ACM	2019-02-25	Paper
Tree-like queries in OWL 2 QL: succinctness and complexity results 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science	2018-04-23	Paper
On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules Web Reasoning and Rule Systems	2017-06-20	Paper
Ontology-Mediated Query Answering with Data-Tractable Description Logics Reasoning Web. Web Logic Rules	2017-03-30	Paper
Inconsistency-Tolerant Querying of Description Logic Knowledge Bases Reasoning Web: Logical Foundation of Knowledge Graph Construction and Query Answering	2017-03-30	Paper
Query and predicate emptiness in ontology-based data access The Journal of Artificial Intelligence Research (JAIR)	2016-05-11	Paper
Regular path queries in lightweight description logics: complexity and algorithms Journal of Artificial Intelligence Research	2015-08-25	Paper
Specifying and computing preferred plans Artificial Intelligence	2011-11-17	Paper

Research outcomes over time

This page was built for person: Meghyn Bienvenu