An inference control algorithm for RDF(S) repository

2Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Protecting RDF(S) repository is a topic in many Web applications. In RDF(S) repository, sensitive information can be inferred from non-sensitive data by iteratively applying the inference rules. Therefore, the problem of inference control is a crucial need for protecting RDF(S) repository. This paper presents an inference control algorithm that can prevent illegal inference effectively. In the algorithm, the inference dependence graph is defined to compute the logic expression of sensitive RDF(S) triples set, which is translated into the disjunctive normal form for obtaining the answers of the inference control problem. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Lu, J., Wang, J., Zhang, Y., Zhou, B., Li, Y., & Miao, Z. (2007). An inference control algorithm for RDF(S) repository. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4430 LNCS, pp. 262–268). Springer Verlag. https://doi.org/10.1007/978-3-540-71549-8_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free