Combining RDF and SPARQL with CP-theories to reason about preferences in a Linked Data setting

Combining RDF and SPARQL with CP-theories to reason about preferences in a Linked Data setting
复制标题

DOI:
10.3233/sw-180339
复制
发表时间:
2020-04
期刊:
影响因子:
3
通讯作者:
V. W. Anelli;R. Leone;T. D. Noia;Thomas Lukasiewicz;Jessica Rosati
V. W. Anelli;R. Leone;T. D. Noia;Thomas Lukasiewicz;Jessica Rosati
中科院分区:
计算机科学3区
文献类型:
--
作者:
V. W. Anelli;R. Leone;T. D. Noia;Thomas Lukasiewicz;Jessica Rosati

文献摘要

相似文献

。偏好表示和推理在支持用户进行复杂的、多因素的决策过程中起着核心作用。事实上,用户的品味可以被用来以个性化的方式对信息和数据进行fi,从而最大化他们的预期效用。多年来,已经提出了许多框架和语言来处理用户偏好。其中,最突出的形式主义代表和推理(定性)的条件偏好(CP)理论(CP理论)。在本文中,我们展示了如何将它们与语义Web技术相结合,以便在标准的SPARQL 1.1查询中编码一组CP语句的语义,这些CP语句通过引用“首选项”OWL本体的RDF三元组来表示用户首选项。特别地,这里我们关注上下文一致条件(CUC)非循环CP-理论[44]。我们提出的框架允许标准SPARQL客户端查询关联数据数据集,并根据一组用户首选项对这些查询的结果进行排序。
. Preference representation and reasoning play a central role in supporting users with complex and multi-factorial decision processes. In fact, user tastes can be used to filter information and data in a personalized way, thus maximizing their expected utility. Over the years, many frameworks and languages have been proposed to deal with user preferences. Among them, one of the most prominent formalism to represent and reason with (qualitative) conditional preferences (CPs) are conditional preference theories ( CP-theories ). In this paper, we show how to combine them with Semantic Web technologies in order to encode in a standard SPARQL 1.1 query the semantics of a set of CP statements representing user preferences by means of RDF triples that refer to a “preference” OWL ontology. In particular, here we focus on context-uniform conditional (cuc) acyclic CP-theories [44]. The framework that we propose allows a standard SPARQL client to query Linked Data datasets, and to order the results of such queries relative to a set of user preferences.