Back to Search
Start Over
Contextual rational closure for defeasible $\mathcal {ALC}$
- Source :
- Annals of Mathematics and Artificial Intelligence. 87:83-108
- Publication Year :
- 2019
- Publisher :
- Springer Science and Business Media LLC, 2019.
-
Abstract
- Description logics have been extended in a number of ways to support defeasible reasoning in the KLM tradition. Such features include preferential or rational defeasible concept inclusion, and defeasible roles in complex concept descriptions. Semantically, defeasible subsumption is obtained by means of a preference order on objects, while defeasible roles are obtained by adding a preference order to role interpretations. In this paper, we address an important limitation in defeasible extensions of description logics, namely the restriction in the semantics of defeasible concept inclusion to a single preference order on objects. We do this by inducing a modular preference order on objects from each modular preference order on roles, and using these to relativise defeasible subsumption. This yields a notion of contextualised rational defeasible subsumption, with contexts described by roles. We also provide a semantic construction for rational closure and a method for its computation, and present a correspondence result between the two.
- Subjects :
- Theoretical computer science
Computer science
business.industry
Applied Mathematics
Complex system
Defeasible estate
02 engineering and technology
Modular design
Semantics
ComputingMethodologies_ARTIFICIALINTELLIGENCE
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
Description logic
Artificial Intelligence
Rational closure
0202 electrical engineering, electronic engineering, information engineering
020201 artificial intelligence & image processing
Defeasible reasoning
business
Preference (economics)
Subjects
Details
- ISSN :
- 15737470 and 10122443
- Volume :
- 87
- Database :
- OpenAIRE
- Journal :
- Annals of Mathematics and Artificial Intelligence
- Accession number :
- edsair.doi...........8ac96676c695d1369122bf0b0f952d31
- Full Text :
- https://doi.org/10.1007/s10472-019-09658-2