Exploiting uncertainty for querying inconsistent description logics knowledge bases
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1285158 (Why is no real title available?)
- A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases
- A tableau decision procedure for \(\mathcal{SHOIQ}\)
- Automata-based axiom pinpointing
- Axiom Pinpointing in General Tableaux
- Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis
- Belief based on inconsistent information
- Classifications for inconsistent theories
- Classifying Inconsistency Measures Using Graphs
- Complexity Results for Probabilistic Datalog
- Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
- Computing and explaining query answers over inconsistent DL-Lite knowledge bases
- Computing optimal repairs of quantified ABoxes w.r.t. static \(\mathcal{EL}\) TBoxes
- Confidences for commonsense reasoning
- Distance-based measures of inconsistency
- Efficient Knowledge Compilation Beyond Weighted Model Counting
- Efficient MUS enumeration of Horn formulae with applications to axiom pinpointing
- Error-tolerant reasoning in the description logic \(\mathcal{EL}\)
- Extended semantics and inference for the Independent Choice Logic
- How a Computer Should Think
- Inconsistency measurement based on variables in minimal unsatisfiable subsets
- Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
- Inconsistency-tolerant reasoning over linear probabilistic knowledge bases
- Inconsistency-tolerant reasoning with OWL DL
- On probabilistic inference by weighted model counting
- On the evaluation of inconsistency measures
- On the implementation of the probabilistic logic programming language ProbLog
- Probabilistic DL reasoning with pinpointing formulas: a Prolog-based approach
- Probabilistic logic
- Reasoning with uncertain and inconsistent OWL ontologies
- Relative inconsistency measures
- Tableau reasoning for description logics and its extension to probabilities
- Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions
- The Bayesian ontology language \(\mathcal {BEL}\)
- The Complexity of Enumeration and Reliability Problems
- The PITA system: tabling and answer subsumption for reasoning under uncertainty
This page was built for publication: Exploiting uncertainty for querying inconsistent description logics knowledge bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6925621)
