pith. sign in

Meghyn Bienvenu

Identifiers

  • name variant Meghyn Bienvenu 0.60 · backfill

Papers (14)

  1. How Hard is it to Decide if a Fact is Relevant to a Query? cs.DB · 2026 · author #1
  2. Inferring High-Level Events from Timestamped Data: Complexity and Medical Applications cs.AI · 2026 · author #2
  3. Using ASP(Q) to Handle Inconsistent Prioritized Data cs.LO · 2026 · author #1
  4. Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments cs.LO · 2022 · author #1
  5. Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation cs.LO · 2020 · author #1
  6. Finite LTL Synthesis with Environment Assumptions and Quality Measures cs.LO · 2018 · author #2
  7. Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151) cs.DB · 2017 · author #4
  8. Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity cs.DB · 2016 · author #1
  9. Theoretically Optimal Datalog Rewritings for OWL 2 QL Ontology-Mediated Queries cs.LO · 2016 · author #1
  10. Combining Existential Rules and Transitivity: Next Steps cs.AI · 2015 · author #2
  11. Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results cs.AI · 2014 · author #1
  12. Nested Regular Path Queries in Description Logics cs.LO · 2014 · author #1
  13. Prime Implicates and Prime Implicants: From Propositional to Modal Logic cs.LO · 2014 · author #1
  14. Ontology-based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP cs.DB · 2013 · author #1

Mentions

  • 1401.3475 #1 · backfill · confidence 0.70 Meghyn Bienvenu
  • 2003.05746 #1 · arxiv_oai · confidence 0.70 Meghyn Bienvenu
  • 1301.6479 #1 · backfill · confidence 0.70 Meghyn Bienvenu

Frequent Coauthors