Meghyn Bienvenu

Venues

Frequent coauthors

Papers

1. Data Complexity of Querying Description Logic Knowledge Bases Under Cost-Based Semantics
   AAAI 2026 · Meghyn Bienvenu
2. How Hard is it to Decide if a Fact is Relevant to a Query?
   KR 2026 · Meghyn Bienvenu
3. Inferring High-Level Events from Timestamped Data: Complexity and Medical Applications
   KR 2026 ·

   Yvon K. Awuklu

   DBLP profile ↗ORCID search ↗
4. Responsibility Measures for Conjunctive Queries with Negation
   ICDT 2026 · Meghyn Bienvenu
5. Using ASP(Q) to Handle Inconsistent Prioritized Data
   KR 2026 · Meghyn Bienvenu
6. A Rule-Based Approach to Specifying Preferences over Conflicting Facts and Querying Inconsistent Knowledge Bases
   KR 2025 · Meghyn Bienvenu
7. Advances in Logic-Based Entity Resolution: Enhancing ASPEN with Local Merges and Optimality Criteria
   KR 2025 ·

   Zhiliang Xiang

   DBLP profile ↗ORCID search ↗
8. Inconsistency Handling in DatalogMTL
   IJCAI 2025 · Meghyn Bienvenu
9. Shapley Value Computation in Ontology-Mediated Query Answering (Extended Abstract)
   IJCAI 2025 · Meghyn Bienvenu
10. Tractable Responsibility Measures for Ontology-Mediated Query Answering
    KR 2025 · Meghyn Bienvenu
11. ASPEN: ASP-Based System for Collective Entity Resolution
    KR 2024 ·

    Zhiliang Xiang

    DBLP profile ↗ORCID search ↗
12. Abductive Reasoning in a Paraconsistent Framework
    KR 2024 · Meghyn Bienvenu
13. Cost-Based Semantics for Querying Inconsistent Weighted Knowledge Bases
    KR 2024 · Meghyn Bienvenu
14. Queries With Exact Truth Values in Paraconsistent Description Logics
    KR 2024 · Meghyn Bienvenu
15. Shapley Value Computation in Ontology-Mediated Query Answering
    KR 2024 · Meghyn Bienvenu