An ASP approach for reasoning in a concept-aware multipreferential lightweight DL

TL;DR

This paper introduces a novel concept-aware multi-preferential semantics for reasoning with typicality in description logics, utilizing Answer Set Programming to handle defeasible inclusions in a lightweight logic.

Contribution

It develops a new multipreferential semantics framework for description logics that incorporates concept preferences and employs ASP for defeasible reasoning.

Findings

Defines a concept-aware multipreference semantics for DLs

Uses ASP (asprin) for defeasible reasoning in EL+bot

Enables reasoning with ranked TBoxes and defeasible inclusions

Abstract

In this paper we develop a concept aware multi-preferential semantics for dealing with typicality in description logics, where preferences are associated with concepts, starting from a collection of ranked TBoxes containing defeasible concept inclusions. Preferences are combined to define a preferential interpretation in which defeasible inclusions can be evaluated. The construction of the concept-aware multipreference semantics is related to Brewka's framework for qualitative preferences. We exploit Answer Set Programming (in particular, asprin) to achieve defeasible reasoning under the multipreference approach for the lightweight description logic EL+bot. The paper is under consideration for acceptance in TPLP.