Defeasible inheritance-based description logics
From MaRDI portal
Recommendations
- Rational Closure for Defeasible Description Logics
- Relevant closure: a new form of defeasible reasoning for description logics
- A KLM perspective on defeasible reasoning for description logics
- A note on a description logic of concept and role typicality for defeasible reasoning over ontologies
- Contextual rational closure for defeasible \(\mathcal{ALC} \)
Cited in
(24)- Query answering in circumscribed OWL2 profiles
- Preferential reasoning for modal logics
- Semantic characterization of rational closure: from propositional logic to description logics
- Reasoning in the defeasible description logic \(\mathcal{EL}_{\bot}\) -- computing standard inferences under rational and relevant semantics
- Typicalities and probabilities of exceptions in nonmotonic description logics
- On rational entailment for propositional typicality logic
- A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure
- An ASP Approach for Reasoning on Neural Networks under a Finitely Many-Valued Semantics for Weighted Conditional Knowledge Bases
- An ASP approach for reasoning in a concept-aware multipreferential lightweight DL
- A note on a description logic of concept and role typicality for defeasible reasoning over ontologies
- Complexity and scalability of defeasible reasoning in many-valued weighted knowledge bases with typicality
- Situated conditional reasoning
- On the logical properties of the nonmonotonic description logic \(\mathcal{DL}^{\operatorname{N}}\)
- A reconstruction of multipreference closure
- Defeasible inheritance with doubt index and its axiomatic characterization
- Contextual rational closure for defeasible \(\mathcal{ALC} \)
- Rational closure for all description logics
- Syntax splitting and reasoning from weakly consistent conditional belief bases with c-inference
- Decidability of circumscribed description logics revisited
- Defeasible RDFS via rational closure
- Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure
- Towards practicable defeasible reasoning for ABoxes
- Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\)
- Classical algorithms for reasoning and explanation in description logics
This page was built for publication: Defeasible inheritance-based description logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2865009)
