Reference : Extending Typicality for Description Logics
Reports : External report
Engineering, computing & technology : Computer science
Computational Sciences
Extending Typicality for Description Logics
Booth, Richard mailto [Cardiff University > School of Computer Science and Informatics]
Casini, Giovanni mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > Computer Science and Communications Research Unit (CSC) >]
Meyer, Thomas mailto [University of Cape Town > Computer Science]
Varzinczak, Ivan mailto [Université d'Artois > CRIL]
University of Luxembourg
[en] Description Logics ; uncertainty ; defeasible reasoning
[en] Recent extensions of description logics for dealing with different forms of non-monotonic reasoning don’t take us beyond the case of defeasible subsumption. In this paper we enrich the DL EL⊥ with a (constrained version of) a typicality operator •, the intuition of which is to capture the most typical members of a class, providing us with the DL EL•⊥. We argue that EL•⊥ is the smallest step one can take to increase the expressivity beyond the case of defeasible subsumption for DLs, while still retaining all the rationality properties an appropriate notion of defeasible subsumption is required to satisfy, and investigate what an appropriate notion of non-monotonic entailment for EL•⊥ should look like.
Fonds National de la Recherche - FnR
FnR ; FNR9181001 > Giovanni Casini > SOUL > Subjective And Objective Uncertainty In Description Logics > 01/07/2015 > 30/06/2017 > 2014

File(s) associated to this reference

Fulltext file(s):

Open access
TforDL-Technical_report.pdfAuthor preprint322.35 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.