Data repair of inconsistent nonmonotonic description logic programs
From MaRDI portal
Recommendations
- Computing repairs of inconsistent DL-programs over \(\mathcal{EL}\) ontologies
- Towards practical deletion repair of inconsistent DL-programs
- Computing repairs for inconsistent DL-programs over \(\mathcal{EL}\) ontologies
- \(\exists \)-ASP for computing repairs with existential ontologies
- Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
Cites work
- scientific article; zbMATH DE number 4174344 (Why is no real title available?)
- scientific article; zbMATH DE number 3648682 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1936671 (Why is no real title available?)
- scientific article; zbMATH DE number 754675 (Why is no real title available?)
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- A formal framework for the study of the notion of undefined particle number in quantum mechanics
- A general framework for reasoning on inconsistency
- A non-monotonic description logic for reasoning about typicality
- A theory of diagnosis from first principles
- Advanced methods for inconsistent knowledge management. With a foreword by Lakmi C. Jain
- An abductive framework for computing knowledge base updates
- An epistemic operator for description logics
- Autoepistemic logic
- Combining answer set programming with description logics for the semantic web
- Computing repairs for inconsistent DL-programs over \(\mathcal{EL}\) ontologies
- Description logics of minimal knowledge and negation as failure
- Efficient HEX-Program Evaluation Based on Unfounded Sets
- Incoherency problems in a combination of description logics and rules
- Inconsistency Tolerance
- Linking Data to Ontologies
- Local closed world reasoning with description logics under the well-founded semantics
- Loop formulas for description logic programs
- On the logic of theory change: Partial meet contraction and revision functions
- Paraconsistent Stable Semantics for Extended Disjunctive Programs
- Policy-based inconsistency management in relational databases
- Prioritized repairing and consistent query answering in relational databases
- Rational Closure for Defeasible Description Logics
- Reasoning about explanations for negative query answers in \textit{DL-Lite}
- Reasoning with inconsistencies in hybrid MKNF knowledge bases
- Reconciling description logics and rules
- Runtime verification using a temporal description logic
- Stepwise debugging of description-logic programs
- The complexity of circumscription in DLs
- The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
- Towards practical deletion repair of inconsistent DL-programs
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Well-founded semantics for description logic programs in the semantic web
Cited in
(10)- Optimal fixed-premise repairs of \(\mathcal{E}\mathcal{L}\) TBoxes
- Towards practical deletion repair of inconsistent DL-programs
- Tractable closure-based possibilistic repair for partially ordered DL-Lite ontologies
- Computing repairs of inconsistent DL-programs over \(\mathcal{EL}\) ontologies
- Computing optimal repairs of quantified ABoxes w.r.t. static \(\mathcal{EL}\) TBoxes
- scientific article; zbMATH DE number 2085288 (Why is no real title available?)
- Computing repairs for inconsistent DL-programs over \(\mathcal{EL}\) ontologies
- Repairing inconsistent answer set programs using rules of thumb: a gene regulatory networks case study
- \(\exists \)-ASP for computing repairs with existential ontologies
- Inconsistency handling in Datalog\(+/-\) ontologies
This page was built for publication: Data repair of inconsistent nonmonotonic description logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322065)
