Query answering over inconsistent knowledge bases: a probabilistic approach
From MaRDI portal
Publication:2084950
Recommendations
Cites work
- scientific article; zbMATH DE number 7368419 (Why is no real title available?)
- Achieving new upper bounds for the hypergraph duality problem through logic
- Acyclicity notions for existential rules and their application to query answering in ontologies
- An Optimal Algorithm for Monte Carlo Estimation
- Anatomy of the Chase
- Computational Complexity
- Computing and explaining query answers over inconsistent DL-Lite knowledge bases
- Data exchange: semantics and query answering
- Datalog vs first-order logic
- Dichotomies for Queries with Negation in Probabilistic Databases
- Incomplete Information in Relational Databases
- Inconsistency-tolerant query answering for existential rules
- Preference-based inconsistency-tolerant query answering under existential rules
- Probabilistic databases
- Probabilistic query answering over inconsistent databases
- Probability Inequalities for Sums of Bounded Random Variables
- Queries and materialized views on probabilistic databases
- Query Rewriting and Optimization for Ontological Databases
- Reasoning about explanations for negative query answers in \textit{DL-Lite}
- Semi-oblivious chase termination: the sticky case
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- The complexity of computing the permanent
- The complexity of counting problems
- The dichotomy of probabilistic inference for unions of conjunctive queries
- Towards more expressive ontology languages: the query answering problem
- Understanding the complexity of axiom pinpointing in lightweight description logics
Cited in
(2)
This page was built for publication: Query answering over inconsistent knowledge bases: a probabilistic approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084950)
