Italiano (Italian) English (Inglese)
Friday, 15 December 2017

Technical Reports

Technical Report Details
Authors:Laura Giordano
Daniele Theseider Dupré
Scientific Area:Knowledge Representation
Title:Reasoning in a rational extension of SROEL
Published on:TR-INF-2016-05-01-UNIPMN
Publisher:DiSIT, Computer Science Institute, UPO
Year:2016
URL:http://www.di.unipmn.it...R-INF-2016-05-01-UNIPMN.pdf
Abstract:In this work we define a rational extension SROEL-RT of the low complexity description logic SROEL, which underlies the OWL EL ontology language. The logic is extended with a typicality operator T, whose semantics is based on Lehmann and Magidor’s ranked models and allows for the definition of defeasible inclusions. We develop a Datalog materialization calculus for rational entailment in SROEL-RT, showing that instance checking can be computed in polynomial time. Also, we show that deciding instance checking under minimal entailment is a coNP-hard problem.