The evolution of Protégé: an environment for knowledge-based systems development
International Journal of Human-Computer Studies
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
Ontology module extraction for ontology reuse: an ontology engineering perspective
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Conservative Extensions in the Lightweight Description Logic $\mathcal{EL}$
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Complexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
CEL: a polynomial-time reasoner for life science ontologies
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Formal Properties of Modularisation
Modular Ontologies
Mathematical Logic for Life Science Ontologies
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Survey of modular ontology techniques and their applications in the biomedical domain
Integrated Computer-Aided Engineering - Selected papers from the IEEE Conference on Information Reuse and Integration (IRI), July 13-15, 2008
Efficient retrieval of ontology fragments using an interval labeling scheme
Information Sciences: an International Journal
The complexity of circumscription in description logic
Journal of Artificial Intelligence Research
Deciding inseparability and conservative extensions in the description logic EL
Journal of Symbolic Computation
Forgetting and uniform interpolation in large-scale description logic terminologies
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Minimal module extraction from DL-lite ontologies using QBF solvers
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Task Oriented Evaluation of Module Extraction Techniques
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Activity recognition in smart homes: from specification to representation
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Logic-based ontology comparison and module extraction, with an application to DL-Lite
Artificial Intelligence
Dependencies between ontology design parameters
International Journal of Metadata, Semantics and Ontologies
Acta Cybernetica
Cohesion and coupling metrics for ontology modules
Information Technology and Management
Modularity in the rule interchange format
RuleML'2011 Proceedings of the 5th international conference on Rule-based reasoning, programming, and applications
Using ontology modularization for efficient negotiation over ontology correspondences in MAS
ArgMAS'09 Proceedings of the 6th international conference on Argumentation in Multi-Agent Systems
An assertion retrieval algebra for object queries over knowledge bases
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
The logical difference for the lightweight description logic EL
Journal of Artificial Intelligence Research
Reasoning over ontologies with hidden content: the import-by-query approach
Journal of Artificial Intelligence Research
Concept adjustment for description logics
Proceedings of the seventh international conference on Knowledge capture
Model-theoretic inseparability and modularity of description logic ontologies
Artificial Intelligence
| Hi-index | 0.00 |
The aim of this paper is to study semantic notions of modularity in description logic (DL) terminologies and reasoning problems that are relevant for modularity. We define two notions of a module whose independence is formalised in a model-theoretic way. Focusing mainly on the DLs EL and ALC, we then develop algorithms for module extraction, for checking whether a part of a terminology is a module, and for a number of related problems. We also analyse the complexity of these problems, which ranges from tractable to undecidable. Finally, we provide an experimental evaluation of our module extraction algorithms based on the large-scale terminology SNOMED CT.