Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
From MaRDI portal
(Redirected from Publication:2970304)
Recommendations
Cites work
- scientific article; zbMATH DE number 1696845 (Why is no real title available?)
- scientific article; zbMATH DE number 4087055 (Why is no real title available?)
- scientific article; zbMATH DE number 1936671 (Why is no real title available?)
- Answer sets for consistent query answering in inconsistent databases
- Data Complexity in the $\mathcal{EL}$ Family of Description Logics
- Data complexity of query answering in description logics
- Database Theory - ICDT 2005
- Deduction in Concept Languages: from Subsumption to Instance Checking
- Inconsistency handling in Datalog\(+/-\) ontologies
- Inconsistency-tolerant query answering: rationality properties and computational complexity analysis
- More complicated questions about maxima and minima, and some closures of NP
- NP trees and Carnap's modal logic
- Nondeterministic Space is Closed under Complementation
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- The DL-Lite Family and Relations
- The complexity of logic-based abduction
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
Cited in
(32)- An integer 0-1 linear programming approach for computing inconsistency degree in product-based possibilistic DL-Lite
- Inconsistency Tolerance
- Controlled query evaluation in description logic ontologies
- An ontology-based approach for handling inconsistency in explainable and prioritized access control models
- Reasoning with uncertain and inconsistent OWL ontologies
- Controlled query evaluation in description logics through consistent query answering
- Updating inconsistent description logic knowledge bases
- Reasoning with ontologies
- Querying incomplete data: complexity and tractability via Datalog and first-order rewritings
- Error-tolerant reasoning in the description logic \(\mathcal{EL}\)
- Inconsistency-tolerant query answering: rationality properties and computational complexity analysis
- Computing and explaining query answers over inconsistent DL-Lite knowledge bases
- Consistent query answering for primary keys in Datalog
- Data repair of inconsistent nonmonotonic description logic programs
- Investigating the mapping between default logic and inconsistency-tolerant semantics
- Inconsistency handling in Datalog\(+/-\) ontologies
- Inconsistency-tolerant semantics based on (preferred) repairs (invited paper)
- Similarity-based relaxed instance queries
- Inconsistency-tolerant reasoning with OWL DL
- Query Rewriting for DL Ontologies Under the ICAR Semantics
- Closure-based tractable possibilistic inference from partially ordered DL-Lite ontologies
- Inconsistency-tolerant instance checking in tractable description logics
- How to tractably compute a productive repair for possibilistic partially ordered DL-Lite\(_{\mathcal{R}}\) ontologies?
- scientific article; zbMATH DE number 7561483 (Why is no real title available?)
- Enhancing cooperativity in controlled query evaluation over ontologies
- Exploiting uncertainty for querying inconsistent description logics knowledge bases
- Classical algorithms for reasoning and explanation in description logics
- Explanation-friendly query answering under uncertainty
- Preference-based inconsistency-tolerant query answering under existential rules
- Inconsistency-tolerant query answering for existential rules
- Tractable closure-based possibilistic repair for partially ordered DL-Lite ontologies
- Selecting accepted assertions in partially ordered inconsistent DL-Lite knowledge bases
This page was built for publication: Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970304)
