Abstract
Modularity of ontologies is currently an active research field, and many different notions of a module have been proposed. In this paper, we review the fundamental principles of modularity and identify formal properties that a robust notion of modularity should satisfy. We explore these properties in detail in the contexts of description logic and classical predicate logic and put them into the perspective of well-known concepts from logic and modular software specification such as interpolation, forgetting and uniform interpolation. We also discuss reasoning problems related to modularity. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Konev, B., Lutz, C., Walther, D., & Wolter, F. (2009). Formal properties of modularisation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5445 LNCS, pp. 25–66). https://doi.org/10.1007/978-3-642-01907-4_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
