Inconsistency-tolerant query answering: rationality properties and computational complexity analysis
From MaRDI portal
Recommendations
- Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
- Inconsistency-tolerant instance checking in tractable description logics
- Computing and explaining query answers over inconsistent DL-Lite knowledge bases
- Complexity Results for Probabilistic Datalog
- How does incoherence affect inconsistency-tolerant semantics for Datalog^?
Cites work
- Answer sets for consistent query answering in inconsistent databases
- Computational Complexity of Probabilistic Turing Machines
- Inconsistency-tolerant query answering: rationality properties and computational complexity analysis
- Linking Data to Ontologies
- Nonmonotonic inference based on expectations
- Nonmonotonic reasoning, preferential models and cumulative logics
- On rules with existential variables: walking the decidability line
- Rational Closure for Defeasible Description Logics
- Towards more expressive ontology languages: the query answering problem
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
Cited in
(16)- Query answering DL-lite knowledge bases from hidden datasets
- A formalism unifying defeasible logics and repair semantics for existential rules
- Preference-based inconsistency-tolerant query answering under existential rules
- Investigating the mapping between default logic and inconsistency-tolerant semantics
- Inconsistency-tolerant query answering: rationality properties and computational complexity analysis
- Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
- Computing and explaining query answers over inconsistent DL-Lite knowledge bases
- Assertional removed sets merging of DL-Lite knowledge bases
- Inconsistency-tolerant instance checking in tractable description logics
- -ASP for computing repairs with existential ontologies
- Selecting accepted assertions in partially ordered inconsistent DL-Lite knowledge bases
- Tractable closure-based possibilistic repair for partially ordered DL-Lite ontologies
- Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
- Closure-based tractable possibilistic inference from partially ordered DL-Lite ontologies
- How to tractably compute a productive repair for possibilistic partially ordered DL-Lite\(_{\mathcal{R}}\) ontologies?
- On quasi-inconsistency and its complexity
This page was built for publication: Inconsistency-tolerant query answering: rationality properties and computational complexity analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835863)
