First-order logic and automated theorem proving (2nd ed.)
First-order logic and automated theorem proving (2nd ed.)
A Deductive System for Non-Monotonic Reasoning
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Web ontology segmentation: analysis, classification and use
Proceedings of the 15th international conference on World Wide Web
Just the right amount: extracting modules from ontologies
Proceedings of the 16th international conference on World Wide Web
Pellet: A practical OWL-DL reasoner
Web Semantics: Science, Services and Agents on the World Wide Web
Reasoning in Description Logics by a Reduction to Disjunctive Datalog
Journal of Automated Reasoning
Ontology module extraction for ontology reuse: an ontology engineering perspective
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
A Resolution-Based Decision Procedure for $\boldsymbol{\mathcal{SHOIQ}}$
Journal of Automated Reasoning
A Modularization-Based Approach to Finding All Justifications for OWL DL Entailments
ASWC '08 Proceedings of the 3rd Asian Semantic Web Conference on The Semantic Web
Non-standard reasoning services for the debugging of description logic terminologies
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
LUBM: A benchmark for OWL knowledge base systems
Web Semantics: Science, Services and Agents on the World Wide Web
Query Answering for OWL-DL with rules
Web Semantics: Science, Services and Agents on the World Wide Web
History matters: incremental ontology reasoning using modules
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
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
Module extraction and incremental classification: a pragmatic approach for ƐL+ ontologies
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
Towards a complete OWL ontology benchmark
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
Decomposition-based optimization for debugging of inconsistent OWL DL ontologies
KSEM'10 Proceedings of the 4th international conference on Knowledge science, engineering and management
Finding all justifications of OWL entailments using TMS and MapReduce
Proceedings of the 20th ACM international conference on Information and knowledge management
Approximating Linear Order Inference in OWL 2 DL by Horn Compilation
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
Finding EL+ justifications using the earley parsing algorithm
AOW '09 Proceedings of the Fifth Australasian Ontology Workshop - Volume 112
Hi-index | 0.00 |
Module extraction methods have proved to be effective in improving the performance of some ontology reasoning tasks, including finding justifications to explain why an entailment holds in an OWL DL ontology. However, the existing module extraction methods that compute a syntactic locality-based module for the sub-concept in a subsumption entailment, though ensuring the resulting module to preserve all justifications of the entailment, may be insufficient in improving the performance of finding all justifications. This is because a syntactic locality-based module is independent of the super-concept in a subsumption entailment and always contains all concept/role assertions. In order to extract smaller modules to further optimize finding all justifications in an OWL DL ontology, we propose a goal-directed method for extracting a module that preserves all justifications of a given entailment. Experimental results on large ontologies show that a module extracted by our method is smaller than the corresponding syntactic locality-based module, making the subsequent computation of all justifications more scalable and more efficient.