Reference : A Polynomial Time Subsumption Algorithm for Nominal Safe $ELO_{\bot}$ under Rational ...
Scientific journals : Article
Engineering, computing & technology : Computer science
Computational Sciences
A Polynomial Time Subsumption Algorithm for Nominal Safe $ELO_{\bot}$ under Rational Closure
Casini, Giovanni mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Straccia, Umberto mailto [Consiglio Nazionale delle Ricerche (CNR) > Istituto di Scienza e Tecnologie dell’Informazione (ISTI)]
Meyer, Thomas mailto [University of Cape Town > Computer Science > > Full Professor]
In press
Information Sciences
Yes (verified by ORBilu)
New York
[en] Description logic EL ; Defeasible reasoning ; Nonmonotonic reasoning
[en] Description Logics (DLs) under Rational Closure (RC) is a well-known framework for non-monotonic reasoning in DLs. In this paper, we address the concept subsumption decision problem under RC for nominal safe $ELO_{\bot}$, a notable and practically important DL representative of the OWL 2 profile OWL 2 EL. Our contribution here is to define a polynomial time subsumption procedure for nominal safe $ELO_{\bot}$ under RC that relies entirely on a series of classical, monotonic $EL_{\bot}$ subsumption tests. Therefore, any existing classical monotonic $EL_{\bot}$ reasoner can be used as a black box to implement our method. We then also adapt the method to one of the known extensions of RC for DLs, namely Defeasible Inheritance-based DLs without losing the computational tractability.
H2020 ; 690974 - MIREL - MIREL - MIning and REasoning with Legal texts

File(s) associated to this reference

Fulltext file(s):

Open access
Information Sciences_ArXiv version.pdfAuthor preprint640.63 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.