Explanations for query answers under existential rules
From MaRDI portal
Cites work
- A Proof Procedure for Data Dependencies
- A theory of diagnosis from first principles
- Abduction from logic programs: Semantics and complexity
- ABox abduction in the description logic \(\mathcal{ALC}\)
- Achieving new upper bounds for the hypergraph duality problem through logic
- Attributive concept descriptions with complements
- Automata-based axiom pinpointing
- Axiom Pinpointing in General Tableaux
- Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis
- Capturing Relativized Complexity Classes without Order
- Complete sets and the polynomial-time hierarchy
- Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
- Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting
- Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting
- Computing and explaining query answers over inconsistent DL-Lite knowledge bases
- Data exchange: semantics and query answering
- Homomorphism preservation theorems
- scientific article; zbMATH DE number 3876591 (Why is no real title available?)
- scientific article; zbMATH DE number 3978432 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1142309 (Why is no real title available?)
- scientific article; zbMATH DE number 2080480 (Why is no real title available?)
- scientific article; zbMATH DE number 7368419 (Why is no real title available?)
- scientific article; zbMATH DE number 2243357 (Why is no real title available?)
- Inconsistency-tolerant query answering for existential rules
- Linking Data to Ontologies
- Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
- Preference-based inconsistency-tolerant query answering under existential rules
- Reasoning about explanations for negative query answers in \textit{DL-Lite}
- Reducibility among combinatorial problems
- Semantics and complexity of abduction from default theories
- Super-Solutions
- Taming the infinite chase: query answering under expressive relational constraints
- The complexity of facets (and some facets of complexity)
- The complexity of logic-based abduction
- The minimal hitting set generation problem: algorithms and computation
- The polynomial-time hierarchy
- The strong exponential hierarchy collapses
- Towards more expressive ontology languages: the query answering problem
- Understanding the complexity of axiom pinpointing in lightweight description logics
This page was built for publication: Explanations for query answers under existential rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6995444)
