ASP for minimal entailment in a rational extension of SROEL

LAURA GIORDANO, DANIELE THESEIDER DUPRÉ
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
more » ... model semantics. We show that, for arbitrarySROEL(⊓,×)RTknowledge bases, instance checking under minimal entailment is ΠP2-complete. Relying on a Small Model result, where models correspond to answer sets of a suitable ASP encoding, we exploit Answer Set Preferences (and, in particular, theasprinframework) for reasoning under minimal entailment.
doi:10.1017/s1471068416000399 fatcat:tf7as3upcrfohn44rbufhxuksy