loading
Papers

Research.Publish.Connect.

Paper

Authors: Gopalakrishnan Krishnasamy Sivaprakasam 1 and Giora Slutzki 2

Affiliations: 1 Central State University, United States ; 2 Iowa State University, United States

ISBN: 978-989-758-220-2

Keyword(s): Secrecy Preserving Reasoning, Knowledge Bases, Modalized Description Logic, Query Answering.

Related Ontology Subjects/Areas/Topics: Agents ; Artificial Intelligence ; Collaboration and e-Services ; e-Business ; Enterprise Information Systems ; Knowledge Engineering and Ontology Development ; Knowledge Representation and Reasoning ; Knowledge-Based Systems ; Privacy, Safety and Security ; Semantic Web ; Soft Computing ; Symbolic Systems

Abstract: In this paper we study Secrecy-Preserving Query Answering problem under the Open World Assumption (OWA) for ELH Knowledge Bases. Here ELH is a top-free description logic ELH augmented with a modal operator ^. We employ a tableau procedure designed to compute a rooted labeled tree T which contains information about some assertional consequences of the given knowledge base. Given a secrecy set S, which is a finite set of assertions, we compute a function E, called an envelope of S, which assigns a set of assertions to each node of T. E provides logical protection to the secrecy set S against the reasoning of a querying agent. Once the tree T and an envelope E are computed, we define the secrecy-preserving tree TE. Based on the information available in TE, assertional queries with modal operator ^ can be answered efficiently while preserving secrecy. To the best of our knowledge, this work is first one studying secrecy-preserving reasoning in description logic augmented with modal operat or ^. When the querying agent asks a query q, the reasoner answers “Yes” if information about q is available in TE; otherwise, the reasoner answers “Unknown”. Being able to answer “Unknown” plays a key role in protecting secrecy under OWA. Since we are not computing all the consequences of the knowledge base, answers to the queries based on just secrecy-preserving tree TE could be erroneous. To fix this problem, we further augment our algorithms by providing recursive query decomposition algorithm to make the query answering procedure foolproof. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.204.48.40

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Krishnasamy Sivaprakasam, G. and Slutzki, G. (2017). Keeping Secrets in Modalized DL Knowledge Bases.In Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-220-2, pages 591-598. DOI: 10.5220/0006202505910598

@conference{icaart17,
author={Gopalakrishnan Krishnasamy Sivaprakasam. and Giora Slutzki.},
title={Keeping Secrets in Modalized DL Knowledge Bases},
booktitle={Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2017},
pages={591-598},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006202505910598},
isbn={978-989-758-220-2},
}

TY - CONF

JO - Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Keeping Secrets in Modalized DL Knowledge Bases
SN - 978-989-758-220-2
AU - Krishnasamy Sivaprakasam, G.
AU - Slutzki, G.
PY - 2017
SP - 591
EP - 598
DO - 10.5220/0006202505910598

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.