Reasoning with data flows and policy propagation rules

被引：3

作者：

Daga, Enrico ^{[1
]}

Gangemi, Aldo ^{[2
,3
]}

Motta, Enrico ^{[1
]}

机构：

[1] Open Univ, Knowledge Media Inst, Walton Hall, Milton Keynes, Bucks, England

[2] Univ Paris 13, Paris, France

[3] CNR, Inst Cognit Sci & Technol, Rome, Italy

来源：

SEMANTIC WEB | 2018年 / 9卷 / 02期

关键词：

Data hub; data flows; policies; rules; formal concept analysis; RDF licenses;

D O I：

10.3233/SW-170266

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Data-oriented systems and applications are at the centre of current developments of the World Wide Web. In these scenarios, assessing what policies propagate from the licenses of data sources to the output of a given data-intensive system is an important problem. Both policies and data flows can be described with Semantic Web languages. Although it is possible to define Policy Propagation Rules (PPR) by associating policies to data flow steps, this activity results in a huge number of rules to be stored and managed. In a recent paper, we introduced strategies for reducing the size of a PPR knowledge base by using an ontology of the possible relations between data objects, the Datanode ontology, and applying the (A) AAAA methodology, a knowledge engineering approach that exploits Formal Concept Analysis (FCA). In this article, we investigate whether this reasoning is feasible and how it can be performed. For this purpose, we study the impact of compressing a rule base associated with an inference mechanism on the performance of the reasoning process. Moreover, we report on an extension of the (A) AAAA methodology that includes a coherency check algorithm, that makes this reasoning possible. We show how this compression, in addition to being beneficial to the management of the knowledge base, also has a positive impact on the performance and resource requirements of the reasoning process for policy propagation.

引用

页码：163 / 183

页数：21

共 50 条

[1]

Alani H., 2013, LECT NOTES COMPUTER, V8218, DOI [10.1007/978-3-642-41335-3, DOI 10.1007/978-3-642-41335-3]

[2]

Antoniou G., 2007, LECT NOTES COMPUTER, V4636, P240, DOI DOI 10.1007/978-3-540-74615-7_4

[3]

Antoniou G., 2003, RUL RUL MAK LANG SEM

[4]

Arenas M., 2015, LECT NOTES COMPUTER, V9367, P57, DOI [10.1007/978-3-319-25010-6_4, DOI 10.1007/978-3-319-25010-6_4]

[5]

Aroyo L., 2009, LECT NOTES COMPUTER, V5554, P723, DOI [10.1007/978-3-642-02121-3_53, DOI 10.1007/978-3-642-02121-3_53]

[6]

Barker K., 2015, ACM, P5, DOI 10.1145/ 2815833.2815839

[7]

Bassiliades N., 2015, LECT NOTES COMPUTER, V9202, P360, DOI [10.1007/978-3-319-21542-6_23, DOI 10.1007/978-3-319-21542-6_23]

[8]

Bischof S., 2015, SEM WEB ISWC 2015 2

[9]

Blomqvist E., 2016, LECT NOTES COMPUTER, V10024, P129, DOI [10.1007/978-3-319-49004-5_9, DOI 10.1007/978-3-319-49004-5_9]

[10]

Bohli J.-M., 2015, 2015 international conference on recent advances in internet of things (riot), P1, DOI DOI 10.1109/RIOT.2015.7104906

← 1 2 3 4 5 →