ASP for minimal entailment in a rational extension of SROEL. Issue 5 (14th October 2016)

• Record Type: Journal Article
• Authors: GIORDANO, LAURA; DUPRÉ, DANIELE THESEIDER
• Editors: Carro, Manuel; King, Andy
• Is Part Of: Theory and practice of logic programming. Volume 16:Issue 5/6(2016)
• Page Start: 738
• Page End: 754
• Publication Date: 2016-10-14
• Subjects: Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068416000399
• Languages: English
• ISSNs: 1471-0684

Abstract

Abstract: In this paper we exploit Answer Set Programming (ASP) for reasoning in a rational extension SROEL (⊓, ×) R T of the low complexity description logic SROEL (⊓, ×), which underlies the OWL EL ontology language. In the extended language, a typicality operatorT is allowed to define conceptsT ( C ) (typical C '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 model semantics. We show that, for arbitrary SROEL (⊓, ×) R T knowledge bases, instance checking under minimal entailment is Π P 2 -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, the asprin framework) for reasoning under minimal entailment.