Responsibility Measures for Conjunctive Queries with Negation
Fuente:
arXiv
Saved in:
| Main Authors: | Bienvenu, Meghyn, Figueira, Diego, Lafourcade, Pierre |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Shapley Revisited: Tractable Responsibility Measures for Query Answers
by: Bienvenu, Meghyn, et al.
Published: (2025)
by: Bienvenu, Meghyn, et al.
Published: (2025)
Shapley Value Computation in Ontology-Mediated Query Answering
by: Bienvenu, Meghyn, et al.
Published: (2024)
by: Bienvenu, Meghyn, et al.
Published: (2024)
How Hard is it to Decide if a Fact is Relevant to a Query?
by: Bienvenu, Meghyn, et al.
Published: (2026)
by: Bienvenu, Meghyn, et al.
Published: (2026)
When is Shapley Value Computation a Matter of Counting?
by: Bienvenu, Meghyn, et al.
Published: (2023)
by: Bienvenu, Meghyn, et al.
Published: (2023)
Tractable Responsibility Measures for Ontology-Mediated Query Answering
by: Bienvenu, Meghyn, et al.
Published: (2025)
by: Bienvenu, Meghyn, et al.
Published: (2025)
A Common Ancestor of PDL, Conjunctive Queries, and Unary Negation First-order
by: Figueira, Diego, et al.
Published: (2025)
by: Figueira, Diego, et al.
Published: (2025)
Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments
by: Bienvenu, Meghyn, et al.
Published: (2022)
by: Bienvenu, Meghyn, et al.
Published: (2022)
Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation
by: Bienvenu, Meghyn, et al.
Published: (2020)
by: Bienvenu, Meghyn, et al.
Published: (2020)
Minimizing Conjunctive Regular Path Queries
by: Figueira, Diego, et al.
Published: (2025)
by: Figueira, Diego, et al.
Published: (2025)
Project-connex Decompositions and Tractability of Aggregate Group-by Conjunctive Queries
by: Figueira, Diego, et al.
Published: (2025)
by: Figueira, Diego, et al.
Published: (2025)
Cost-Based Semantics for Querying Inconsistent Weighted Knowledge Bases
by: Bienvenu, Meghyn, et al.
Published: (2024)
by: Bienvenu, Meghyn, et al.
Published: (2024)
Queries With Exact Truth Values in Paraconsistent Description Logics
by: Bienvenu, Meghyn, et al.
Published: (2024)
by: Bienvenu, Meghyn, et al.
Published: (2024)
Boundedness for Unions of Conjunctive Regular Path Queries over Simple Regular Expressions
by: Figueira, Diego, et al.
Published: (2024)
by: Figueira, Diego, et al.
Published: (2024)
Direct Access for Conjunctive Queries with Negations
by: Capelli, Florent, et al.
Published: (2023)
by: Capelli, Florent, et al.
Published: (2023)
Inconsistency Handling in Prioritized Databases with Universal Constraints: Complexity Analysis and Links with Active Integrity Constraints
by: Bienvenu, Meghyn, et al.
Published: (2023)
by: Bienvenu, Meghyn, et al.
Published: (2023)
Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries
by: Figueira, Diego, et al.
Published: (2022)
by: Figueira, Diego, et al.
Published: (2022)
A Rule-Based Approach to Specifying Preferences over Conflicting Facts and Querying Inconsistent Knowledge Bases
by: Bienvenu, Meghyn, et al.
Published: (2025)
by: Bienvenu, Meghyn, et al.
Published: (2025)
Inconsistency Handling in DatalogMTL
by: Bienvenu, Meghyn, et al.
Published: (2025)
by: Bienvenu, Meghyn, et al.
Published: (2025)
Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries
by: Khamis, Mahmoud Abo, et al.
Published: (2025)
by: Khamis, Mahmoud Abo, et al.
Published: (2025)
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations
by: Focke, Jacob, et al.
Published: (2021)
by: Focke, Jacob, et al.
Published: (2021)
Using ASP(Q) to Handle Inconsistent Prioritized Data
by: Bienvenu, Meghyn, et al.
Published: (2026)
by: Bienvenu, Meghyn, et al.
Published: (2026)
Ranked Enumeration of Conjunctive Query Results
by: Deep, Shaleen, et al.
Published: (2019)
by: Deep, Shaleen, et al.
Published: (2019)
Extremal Fitting Problems for Conjunctive Queries
by: Cate, Balder ten, et al.
Published: (2022)
by: Cate, Balder ten, et al.
Published: (2022)
Finding Smallest Witnesses for Conjunctive Queries
by: Hu, Xiao, et al.
Published: (2023)
by: Hu, Xiao, et al.
Published: (2023)
Output-sensitive Conjunctive Query Evaluation
by: Deep, Shaleen, et al.
Published: (2024)
by: Deep, Shaleen, et al.
Published: (2024)
Linear Programs with Conjunctive Database Queries
by: Capelli, Florent, et al.
Published: (2022)
by: Capelli, Florent, et al.
Published: (2022)
Guarded Negation Transitive Closure Logic
by: Figueira, Diego, et al.
Published: (2025)
by: Figueira, Diego, et al.
Published: (2025)
ASPEN: ASP-Based System for Collective Entity Resolution
by: Xiang, Zhiliang, et al.
Published: (2024)
by: Xiang, Zhiliang, et al.
Published: (2024)
Consistent Query Answering for Primary Keys and Conjunctive Queries with Counting
by: Khalfioui, Aziz Amezian El, et al.
Published: (2022)
by: Khalfioui, Aziz Amezian El, et al.
Published: (2022)
Diversity of Answers to Conjunctive Queries
by: Merkl, Timo Camillo, et al.
Published: (2023)
by: Merkl, Timo Camillo, et al.
Published: (2023)
Space-Time Tradeoffs for Spatial Conjunctive Queries
by: Esmailpour, Aryan, et al.
Published: (2025)
by: Esmailpour, Aryan, et al.
Published: (2025)
Quantum Computing for Query Containment of Conjunctive Queries
by: Gerlach, Luisa, et al.
Published: (2026)
by: Gerlach, Luisa, et al.
Published: (2026)
Complexity of Evaluating GQL Queries
by: Figueira, Diego, et al.
Published: (2024)
by: Figueira, Diego, et al.
Published: (2024)
Lower Bounds for Conjunctive Query Evaluation
by: Mengel, Stefan
Published: (2025)
by: Mengel, Stefan
Published: (2025)
Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries
by: Standke, Christoph, et al.
Published: (2025)
by: Standke, Christoph, et al.
Published: (2025)
Conjunctive Queries with Free Access Patterns under Updates
by: Kara, Ahmet, et al.
Published: (2022)
by: Kara, Ahmet, et al.
Published: (2022)
Advances in Logic-Based Entity Resolution: Enhancing ASPEN with Local Merges and Optimality Criteria
by: Xiang, Zhliang, et al.
Published: (2025)
by: Xiang, Zhliang, et al.
Published: (2025)
Enumeration Algorithms for Conjunctive Queries with Projection
by: Deep, Shaleen, et al.
Published: (2021)
by: Deep, Shaleen, et al.
Published: (2021)
Towards Parameterized Hardness on Maintaining Conjunctive Queries
by: Wang, Qichen
Published: (2026)
by: Wang, Qichen
Published: (2026)
Minimally Factorizing the Provenance of Self-join Free Conjunctive Queries
by: Makhija, Neha, et al.
Published: (2021)
by: Makhija, Neha, et al.
Published: (2021)
Similar Items
-
Shapley Revisited: Tractable Responsibility Measures for Query Answers
by: Bienvenu, Meghyn, et al.
Published: (2025) -
Shapley Value Computation in Ontology-Mediated Query Answering
by: Bienvenu, Meghyn, et al.
Published: (2024) -
How Hard is it to Decide if a Fact is Relevant to a Query?
by: Bienvenu, Meghyn, et al.
Published: (2026) -
When is Shapley Value Computation a Matter of Counting?
by: Bienvenu, Meghyn, et al.
Published: (2023) -
Tractable Responsibility Measures for Ontology-Mediated Query Answering
by: Bienvenu, Meghyn, et al.
Published: (2025)