Query answering over inconsistent knowledge bases: a probabilistic approach
From MaRDI portal
Publication:2084950
DOI10.1016/j.tcs.2022.09.005OpenAlexW4295009405MaRDI QIDQ2084950
Marco Calautti, Cristian Molinaro, Sergio Greco, Irina Trubitsyna
Publication date: 14 October 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.09.005
approximation algorithmsprobabilistic databasesconsistent query answeringinconsistent knowledge bases
Cites Work
- Unnamed Item
- Unnamed Item
- Towards more expressive ontology languages: the query answering problem
- Probabilistic query answering over inconsistent databases
- Queries and materialized views on probabilistic databases
- Data exchange: semantics and query answering
- The complexity of computing the permanent
- Datalog vs first-order logic
- Understanding the complexity of axiom pinpointing in lightweight description logics
- Semi-oblivious chase termination: the sticky case
- Preference-based inconsistency-tolerant query answering under existential rules
- Inconsistency-tolerant query answering for existential rules
- Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies
- Reasoning about Explanations for Negative Query Answers in DL-Lite
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Probabilistic Databases
- Computing and Explaining Query Answers over Inconsistent DL-Lite Knowledge Bases
- Incomplete Information in Relational Databases
- Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
- Anatomy of the Chase
- An Optimal Algorithm for Monte Carlo Estimation
- Query Rewriting and Optimization for Ontological Databases
- Dichotomies for Queries with Negation in Probabilistic Databases
- Computational Complexity
- Probability Inequalities for Sums of Bounded Random Variables
- The dichotomy of probabilistic inference for unions of conjunctive queries
