A theory of diagnosis from first principles
Artificial Intelligence
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Secure resource description framework: an access control model
Proceedings of the eleventh ACM symposium on Access control models and technologies
Pellet: A practical OWL-DL reasoner
Web Semantics: Science, Services and Agents on the World Wide Web
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
Extending Description Logics with Uncertainty Reasoning in Possibilistic Logic
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
On the Semantics of Trust and Caching in the Semantic Web
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
A Tableau Algorithm for Possibilistic Description Logic $\mathcal{ALC}$
ASWC '08 Proceedings of the 3rd Asian Semantic Web Conference on The Semantic Web
Finding maximally satisfiable terminologies for the description logic ALC
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Access Policy Design Supported by FCA Methods
ICCS '09 Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies
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
Coloring RDF Triples to Capture Provenance
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
The OWL API: A Java API for OWL ontologies
Semantic Web
CEL: a polynomial-time reasoner for life science ontologies
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A generic approach for correcting access restrictions to a consequence
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part I
Hi-index | 0.00 |
The framework developed in this paper can deal with scenarios where selected sub-ontologies of a large ontology are offered as views to users, based on contexts like the access rights of a user, the trust level required by the application, or the level of detail requested by the user. Instead of materializing a large number of different sub-ontologies, we propose to keep just one ontology, but equip each axiom with a label from an appropriate context lattice. The different contexts of this ontology are then also expressed by elements of this lattice. For large-scale ontologies, certain consequences (like the subsumption hierarchy) are often pre-computed. Instead of pre-computing these consequences for every context, our approach computes just one label (called a boundary) for each consequence such that a comparison of the user label with the consequence label determines whether the consequence follows from the sub-ontology determined by the context. We describe different black-box approaches for computing boundaries, and present first experimental results that compare the efficiency of these approaches on large real-world ontologies. Black-box means that, rather than requiring modifications of existing reasoning procedures, these approaches can use such procedures directly as sub-procedures, which allows us to employ existing highly-optimized reasoners. Similar to designing ontologies, the process of assigning axiom labels is error-prone. For this reason, we also address the problem of how to repair the labelling of an ontology in case the knowledge engineer notices that the computed boundary of a consequence does not coincide with her intuition regarding in which context the consequence should or should not be visible.