External report (Reports)
Extending Typicality for Description Logics
Booth, Richard; Casini, Giovanni; Meyer, Thomas et al.
2017
 

Files


Full Text
TforDL-Technical_report.pdf
Author preprint (330.09 kB)
Download

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
Description Logics; uncertainty; defeasible reasoning
Abstract :
[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.
Disciplines :
Computer science
Author, co-author :
Booth, Richard;  Cardiff University > School of Computer Science and Informatics
Casini, Giovanni ;  University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > Computer Science and Communications Research Unit (CSC)
Meyer, Thomas;  University of Cape Town > Computer Science
Varzinczak, Ivan;  Université d'Artois > CRIL
Language :
English
Title :
Extending Typicality for Description Logics
Publication date :
2017
Publisher :
University of Luxembourg
Focus Area :
Computational Sciences
FnR Project :
FNR9181001 - Subjective And Objective Uncertainty In Description Logics, 2014 (01/07/2015-30/06/2017) - Giovanni Casini
Funders :
FNR - Fonds National de la Recherche [LU]
Available on ORBilu :
since 09 September 2017

Statistics


Number of views
84 (3 by Unilu)
Number of downloads
60 (5 by Unilu)

Bibliography


Similar publications



Contact ORBilu