Query answering over inconsistent knowledge bases: a probabilistic approach
type: Item
instance of: scholarly article
title: Query answering over inconsistent knowledge bases: a probabilistic approach
author: Marco Calautti
author: Sergio Greco
author: Cristian Molinaro
author: Irina Trubitsyna
published in: Theoretical Computer Science
publication date: 2022-10-14T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7601543
zbMATH Keywords: consistent query answering
zbMATH Keywords: inconsistent knowledge bases
zbMATH Keywords: approximation algorithms
zbMATH Keywords: probabilistic databases
MaRDI profile type: Publication
full work available at URL: j.tcs.2022.09.005
OpenAlex ID: W4295009405
cites work: Datalog vs first-order logic
cites work: Computational Complexity
cites work: Computing and Explaining Query Answers over Inconsistent DL-Lite Knowledge Bases
cites work: Preference-based inconsistency-tolerant query answering under existential rules
cites work: Semi-oblivious chase termination: the sticky case
cites work: Towards more expressive ontology languages: the query answering problem
cites work: Reasoning about explanations for negative query answers in \textit{DL-Lite}
cites work: Q4999267
cites work: Acyclicity notions for existential rules and their application to query answering in ontologies
cites work: An Optimal Algorithm for Monte Carlo Estimation
cites work: Queries and materialized views on probabilistic databases
cites work: The dichotomy of probabilistic inference for unions of conjunctive queries
cites work: Data exchange: semantics and query answering
cites work: Dichotomies for Queries with Negation in Probabilistic Databases
cites work: Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
cites work: Query Rewriting and Optimization for Ontological Databases
cites work: Anatomy of the Chase
cites work: Probabilistic query answering over inconsistent databases
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Incomplete Information in Relational Databases
cites work: Inconsistency-tolerant query answering for existential rules
cites work: Understanding the complexity of axiom pinpointing in lightweight description logics
cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
cites work: Probabilistic Databases
cites work: The complexity of computing the permanent
cites work: The complexity of counting problems
DOI: 10.1016/J.TCS.2022.09.005
description: scientific article; zbMATH DE number 7601543