An ASP approach for reasoning in a concept-aware multipreferential lightweight DL
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.
Cite
@article{arxiv.2006.04387,
title = {An ASP approach for reasoning in a concept-aware multipreferential lightweight DL},
author = {Laura Giordano and Daniele Theseider Dupré},
journal= {arXiv preprint arXiv:2006.04387},
year = {2020}
}
Comments
Paper presented at the 36th International Conference on Logic Programming (ICLP 2020), University Of Calabria, Rende (CS), Italy, September 2020