TY - JOUR
T1 - Defeasible reasoning in SROEL
T2 - From rational entailment to rational closure
AU - Giordano, Laura
AU - Dupré, Daniele Theseider
N1 - Publisher Copyright:
© 2018 IOS Press. All rights reserved.
PY - 2018
Y1 - 2018
N2 - In this work we study a rational extension SROEL(u;×)R T of the low complexity description logic SROEL(u; ×), which underlies the OWL EL ontology language. The extension involves a typicality operator T, whose semantics is based on Lehmann and Magidor's ranked models and allows for the definition of defeasible inclusions. We consider both rational entailment and minimal entailment. We show that deciding instance checking under minimal entailment is in general IIP2 -hard, while, under rational entailment, instance checking can be computed in polynomial time. We develop a Datalog calculus for instance checking under rational entailment and exploit it, with stratified negation, for computing the rational closure of simple KBs in polynomial time.
AB - In this work we study a rational extension SROEL(u;×)R T of the low complexity description logic SROEL(u; ×), which underlies the OWL EL ontology language. The extension involves a typicality operator T, whose semantics is based on Lehmann and Magidor's ranked models and allows for the definition of defeasible inclusions. We consider both rational entailment and minimal entailment. We show that deciding instance checking under minimal entailment is in general IIP2 -hard, while, under rational entailment, instance checking can be computed in polynomial time. We develop a Datalog calculus for instance checking under rational entailment and exploit it, with stratified negation, for computing the rational closure of simple KBs in polynomial time.
UR - http://www.scopus.com/inward/record.url?scp=85049686960&partnerID=8YFLogxK
U2 - 10.3233/FI-2018-1698
DO - 10.3233/FI-2018-1698
M3 - Article
SN - 0169-2968
VL - 161
SP - 135
EP - 161
JO - Fundamenta Informaticae
JF - Fundamenta Informaticae
IS - 1-2
ER -