ASP for Minimal Entailment in a Rational Extension of SROEL

TL;DR

This paper uses Answer Set Programming to reason about a rational extension of SROEL with a typicality operator, analyzing minimal entailment complexity and proposing ASP-based reasoning methods.

Contribution

It introduces an ASP-based approach for reasoning in a rational extension of SROEL, handling minimal entailment with a novel ASP encoding and preferences.

Findings

Instance checking under minimal entailment is rom the abstract, the specific findings are not provided.

The approach leverages ASP and answer set preferences for effective reasoning.

Complexity of minimal entailment is rom the abstract, the specific findings are not provided.

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 operator T is allowed to define concepts T(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 \Pi^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. The paper is under consideration for acceptance in Theory and Practice of Logic Programming.