A theory of diagnosis from first principles
Artificial Intelligence
Axiom Pinpointing in General Tableaux
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
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
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
Reasoning and explanation in EL and in expressive description logics
ReasoningWeb'10 Proceedings of the 6th international conference on Semantic technologies for software engineering
Query-based access control for ontologies
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Controlling access to RDF graphs
FIS'10 Proceedings of the Third future internet conference on Future internet
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
Using sums-of-products for non-standard reasoning
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
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 criteria like the user's access right, 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 labeling lattice. The access right, required trust level, etc. is then also represented by a label (called user label) from this lattice, and the corresponding sub-ontology is determined by comparing this label with the axiom labels. For large-scale ontologies, certain consequence (like the concept hierarchy) are often precomputed. Instead of precomputing these consequences for every possible sub-ontology, our approach computes just one label for each consequence such that a comparison of the user label with the consequence label determines whether the consequence follows from the corresponding sub-ontology or not. In this paper we determine under which restrictions on the user and axiom labels such consequence labels (called boundaries) always exist, 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.