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

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 preferen...

Full description

Saved in:
Bibliographic Details
Published in:Theory and practice of logic programming Vol. 20; no. 5; pp. 751 - 766
Main Authors: Giordano, Laura, Theseider Dupré, Daniele
Format: Journal Article
Language:English
Published: Cambridge, UK Cambridge University Press 01.09.2020
Subjects:
Declarative programming
Inclusions
Lightweight
Mathematical programming
Original Article
Reasoning
Semantics
Description Logics
Nonmonotonic Reasoning
Preferences
ASP
ISSN:1471-0684, 1475-3081
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 ξ$\mathcal L_ \bot ^ + $.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1471-0684
1475-3081
DOI:10.1017/S1471068420000381