Fast Compliance Checking in an OWL2 Fragment

We illustrate a formalization of data usage policies in a fragment of OWL2. It can be used to encode (i) a company’s data protection policy, (ii) data subjects’ consent to data processing, and (iii) part of the GDPR (the forthcoming European Data Protection Regulation). Then a company’s policy can be checked for compliance with data subjects’ consent and with part of the GDPR by means of subsumption queries. We provide a complete and tractable structural subsumption algorithm for compliance checking and prove the intractability of a natural generalization of the policy language.

[1]  Timothy W. Finin,et al.  A policy language for a pervasive computing environment , 2003, Proceedings POLICY 2003. IEEE 4th International Workshop on Policies for Distributed Systems and Networks.

[2]  Peter F. Patel-Schneider,et al.  A Semantics and Complete Algorithm for Subsumption in the CLASSIC Description Logic , 1993, J. Artif. Intell. Res..

[3]  James A. Hendler,et al.  Analyzing web access control policies , 2007, WWW '07.

[4]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[5]  Franz Baader,et al.  Pushing the EL Envelope Further , 2008, OWLED.

[6]  Jeffrey M. Bradshaw,et al.  KAoS policy and domain services: toward a description-logic approach to policy representation, deconfliction, and enforcement , 2003, Proceedings POLICY 2003. IEEE 4th International Workshop on Policies for Distributed Systems and Networks.

[7]  Piero A. Bonatti,et al.  A Rule-Based Trust Negotiation System , 2010, IEEE Transactions on Knowledge and Data Engineering.

[8]  Carsten Lutz,et al.  Complexity of Subsumption in the [Escr ][Lscr ] Family of Description Logics: Acyclic and Cyclic TBoxes , 2008, ECAI.

[9]  Yevgeny Kazakov,et al.  From Polynomial Procedures to Efficient Reasoning with EL Ontologies , 2013 .

[10]  Franz Baader,et al.  Pushing the EL Envelope , 2005, IJCAI.