Navigation
Home Contact Us Search the SiteThe ebbits Project
Project Overview The Platform Try our ebbits on-line demos Partners List of deliverablesNewsroom
All News Events Conference publications Journal publications All project publications ebbits in the press Video archiveAffiliations
The ebbits project is affiliated with the following programs and organisations:
The ebbits project is active in the FInES cluster, the Future Internet Enterprise Systems (FInES) Cluster, where ebbits is leading the taskforces on international relations and manufacture and industry. Read more here.
The ebbits project is part of the Cluster of European projects on the Internet of Things. The Cluster aims to promote a common vision of the Internet of Things. ebbits is leading the taskforce on semantic interoperability
About us
The ebbits project is a 4-year project started in 2010. It is partly funded by the European Commission under the 7th Framework Programme in the area of Internet of Things and Enterprise environments under Grant Agreement no. 257852
Impressum Privacy
Impressum Privacy
Newsletter Subscription
Registered Members Only
Previous newsletters
Read previous issues of our newsletter here:
September 2011 August 2012 August 2013
June 2014
March 2015Popular Downloads
| D5.1.1 Concept and Tec... |
14819 |
| Anonymous Networking ... |
9567 |
| D3.8 Legal, IPR and li... |
8828 |
| The EBBITS Project: An... |
7332 |
| Context-Dependent View... |
4679 |
Sign In
Downloads: Correcting Access Restrictions to a Consequence More Flexibly
Downloads Home > Conference and other scientific publications > Correcting Access Restrictions to a Consequence More Flexibly
Correcting Access Restrictions to a Consequence More Flexibly | ||||
| Abstract. Recent research has shown that labeling ontologies can be useful for restricting the access to some of the axioms and their implicit consequences. However, the labeling of the axioms is an error-prone and highly sensible task. In previous work we have shown how to correct the access restrictions if the security administrator knows the precise access level that a consequence must receive, and axioms are relabeled to that same access level. In this paper, we look at a more general situation in which access rights can be granted or denied to some specific users, without having to fully specify the precise access level. We also allow a more flexible labeling function, where the new access level of the relabeled axioms may diff er from the level of the restriction. We provide black-box algorithms for computing suggestions of axioms to be relabeled. The workshop paper was presented at The 24th International Workshop on Description Logics (DL 2011) in Barcelona, Spain on 13-16 July 2011 |
| |||
Download: 
|
||||
 |
Downloads: 100 Downloaded: 181761 Most Downloaded: D5.1.1 Concept and Technologies in Intelligent Service Structures 1.pdf [ 14819 ] Most Recent: Brochure [ 1879 ] |