Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure
From MaRDI portal
Publication:4988945
Abstract: Reasoning about exceptions in ontologies is nowadays one of the challenges the description logics community is facing. The paper describes a preferential approach for dealing with exceptions in Description Logics, based on the rational closure. The rational closure has the merit of providing a simple and efficient approach for reasoning with exceptions, but it does not allow independent handling of the inheritance of different defeasible properties of concepts. In this work we outline a possible solution to this problem by introducing a variant of the lexicographical closure, that we call skeptical closure, which requires to construct a single base. We develop a bi-preference semantics semantics for defining a characterization of the skeptical closure.
Recommendations
- A reconstruction of multipreference closure
- Rational closure for all description logics
- Relevant closure: a new form of defeasible reasoning for description logics
- Semantic characterization of rational closure: from propositional logic to description logics
- Revision of ontologies to accommodate exceptions: a typicality-based approach
Cites work
- A non-monotonic description logic for reasoning about typicality
- Another perspective on default reasoning
- Combining answer set programming with description logics for the semantic web
- Conditionals in nonmonotonic reasoning and belief revision. Considering conditionals as agents
- Contextual rational closure for defeasible \(\mathcal{ALC} \)
- Defeasible inclusions in low-complexity DLs
- Defeasible inheritance-based description logics
- Defeasible reasoning in \(\mathcal{SROEL}\): from rational entailment to rational closure
- Description logics of minimal knowledge and negation as failure
- Enhancing context knowledge repositories with justifiable exceptions
- Expressive probabilistic description logics
- Including quantification in defeasible reasoning for the description logic \(\mathcal{EL}_{\bot}\)
- Maximum entropy calculations for the probabilistic description logic \(\mathcal{ALC}^{\mathsf{ME}}\)
- Nonmonotonic reasoning, conditional objects and possibility theory
- Nonmonotonic reasoning, preferential models and cumulative logics
- On the logical properties of the nonmonotonic description logic \(\mathcal{DL}^{\operatorname{N}}\)
- Preferential Description Logics
- Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic
- Rational Closure for Defeasible Description Logics
- Rationality and context in defeasible subsumption
- Reasoning about Multiple Aspects in Rational Closure for DLs
- Reasoning about exceptions in ontologies: an approximation of the multipreference semantics
- Reasoning in the defeasible description logic \(\mathcal{EL}_{\bot}\) -- computing standard inferences under rational and relevant semantics
- Reconciling OWL and non-monotonic rules for the semantic web
- Reconciling description logics and rules
- Relevant closure: a new form of defeasible reasoning for description logics
- Semantic characterization of rational closure: from propositional logic to description logics
- The Description Logic Handbook
- The complexity of circumscription in DLs
- Towards a Rational Closure for Expressive Description Logics: the Case of 𝒮𝒽𝒾𝓆
- Towards rational closure for fuzzy logic: the case of propositional Gödel logic
- Well-founded semantics for description logic programs in the semantic web
- What does a conditional knowledge base entail?
Cited in
(3)
This page was built for publication: Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4988945)
