当前位置:
X-MOL 学术
›
Theory Pract. Log. Program.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
An ASP approach for reasoning in a concept-aware multipreferential lightweight DL
Theory and Practice of Logic Programming ( IF 1.4 ) Pub Date : 2020-09-21 , DOI: 10.1017/s1471068420000381 Laura Giordano , Daniele Theseider Dupré
Theory and Practice of Logic Programming ( IF 1.4 ) Pub Date : 2020-09-21 , DOI: 10.1017/s1471068420000381 Laura Giordano , Daniele Theseider Dupré
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 ^ + $ .
中文翻译:
一种在概念感知的多优先轻量级 DL 中进行推理的 ASP 方法
在本文中,我们开发了一种概念感知多偏好语义,用于处理描述逻辑中的典型性,其中偏好与概念相关联,从包含可废止概念包含的排序 TBox 集合开始。组合偏好以定义可以评估可废止夹杂物的优先解释。概念感知多偏好语义的构建与 Brewka 的定性偏好框架有关。我们利用答案集编程(特别是,阿司匹林 ) 以实现轻量级描述逻辑 ξ 的多重偏好方法下的可废止推理$\mathcal L_ \bot ^ + $ .
更新日期:2020-09-21
中文翻译:
一种在概念感知的多优先轻量级 DL 中进行推理的 ASP 方法
在本文中,我们开发了一种概念感知多偏好语义,用于处理描述逻辑中的典型性,其中偏好与概念相关联,从包含可废止概念包含的排序 TBox 集合开始。组合偏好以定义可以评估可废止夹杂物的优先解释。概念感知多偏好语义的构建与 Brewka 的定性偏好框架有关。我们利用答案集编程(特别是,