Authors:
Gopalakrishnan Krishnasamy Sivaprakasam
1
and
Giora Slutzki
2
Affiliations:
1
Department of Mathematics & Computer Science, Central State University, Wilberforce, Ohio, U.S.A.
;
2
Department of Computer Science, Iowa State University, Ames, Iowa, U.S.A.
Keyword(s):
Secrecy Preserving Reasoning, Knowledge Bases, MapReduce Algorithm.
Abstract:
In this paper, we have used the MapReduce algorithm to study the problem of secrecy-preserving reasoning in a very large ELH knowledge bases. A tableau algorithm for ABox reasoning is designed in a way that is suitable for MapReduce framework and contains a small set of reasoning rules. To implement the parallelization method, we have designed map and reduce functions for each of these ABox reasoning rules. The output of this computational procedure is a finite set A∗ which contains assertional consequences of the given knowledge base. Given a finite secrecy set S, we compute a set E, called an envelope of S, which provides logical protection to the secrecy set S against the reasoning of a querying agent. To compute E, a tableau algorithm is designed by inverting ABox reasoning rules in a way that is suitable for MapReduce framework. Further, to implement the parallelization method, we have designed map and reduce functions for each of these inverted rules.