A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
ASP for minimal entailment in a rational extension of SROEL
2016
Theory and Practice of Logic Programming
AbstractIn this paper we exploit Answer Set Programming (ASP) for reasoning in a rational extensionSROEL(⊓,×)RTof the low complexity description logicSROEL(⊓, ×), which underlies the OWL EL ontology language. In the extended language, a typicality operatorTis allowed to define conceptsT(C) (typicalC's) under a rational semantics. It has been proven that instance checking under rational entailment has a polynomial complexity. To strengthen rational entailment, in this paper we consider a minimal
doi:10.1017/s1471068416000399
fatcat:tf7as3upcrfohn44rbufhxuksy