Defeasible inclusions in low-complexity DLs
From MaRDI portal
Recommendations
- Defeasible reasoning in \(\mathcal{SROEL}\): from rational entailment to rational closure
- The complexity of circumscription in DLs
- Including quantification in defeasible reasoning for the description logic \(\mathcal{EL}_{\bot}\)
- Reasoning in the defeasible description logic \(\mathcal{EL}_{\bot}\) -- computing standard inferences under rational and relevant semantics
- Representation theorems and locality for subsumption testing and interpolation in the description logics \(\mathcal{EL}\), \(\mathcal{EL}^+\) and their extensions with \(n\)-ary roles and numerical domains
Cited in
(21)- A note on a description logic of concept and role typicality for defeasible reasoning over ontologies
- System \(\text{Z}^{\text{FO}}\): default reasoning with system Z-like ranking functions for unary first-order conditional knowledge bases
- Reasoning in the defeasible description logic \(\mathcal{EL}_{\bot}\) -- computing standard inferences under rational and relevant semantics
- Enhancing context knowledge repositories with justifiable exceptions
- Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\)
- A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure
- Contextual rational closure for defeasible \(\mathcal{ALC} \)
- On the logical properties of the nonmonotonic description logic \(\mathcal{DL}^{\operatorname{N}}\)
- Introducing role defeasibility in description logics
- A tableau calculus for a nonmonotonic extension of \(\mathcal{EL}^\bot\)
- The complexity of circumscription in DLs
- ASP for minimal entailment in a rational extension of SROEL
- Representation theorems and locality for subsumption testing and interpolation in the description logics \(\mathcal{EL}\), \(\mathcal{EL}^+\) and their extensions with \(n\)-ary roles and numerical domains
- Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure
- An ASP approach for reasoning in a concept-aware multipreferential lightweight DL
- A system Z-like approach for first-order default reasoning
- Decidability of circumscribed description logics revisited
- Reasoning on with Defeasibility in ASP
- Deciding subsumption in defeasible \(\mathcal{ELI}_\bot\) with typicality models
- Complexity and scalability of defeasible reasoning in many-valued weighted knowledge bases with typicality
- Query answering in circumscribed OWL2 profiles
This page was built for publication: Defeasible inclusions in low-complexity DLs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3112648)
