The inference problem: a survey
ACM SIGKDD Explorations Newsletter
Reducing inference control to access control for normalized database schemas
Information Processing Letters
Pinpointing in the Description Logic $\mathcal {EL}^+$
KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
Automata-Based Axiom Pinpointing
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Finding maximally satisfiable terminologies for the description logic ALC
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Non-standard reasoning services for the debugging of description logic terminologies
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Debugging unsatisfiable classes in OWL ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
Axiom Pinpointing in General Tableaux
Journal of Logic and Computation
Finding all justifications of OWL DL entailments
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Query-based access control for ontologies
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Using provenance to debug changing ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
A general framework for representing, reasoning and querying with annotated Semantic Web data
Web Semantics: Science, Services and Agents on the World Wide Web
Context-dependent views to axioms and consequences of Semantic Web ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
Access control for RDF graphs using abstract models
Proceedings of the 17th ACM symposium on Access Control Models and Technologies
| Hi-index | 0.00 |
Recent research has shown that annotations are useful for representing access restrictions to the axioms of an ontology and their implicit consequences. Previous work focused on assigning a label, representing its access level, to each consequence from a given ontology. However, a security administrator might not be satisfied with the access level obtained through these methods. In this case, one is interested in finding which axioms would need to get their access restrictions modified in order to get the desired label for the consequence. In this paper we look at this problem and present algorithms for solving it with a variety of optimizations. We also present first experimental results on large scale ontologies, which show that our methods perform well in practice.