Abstract
In this paper we investigate module extraction for the Description Logic SRIQ. We formulate modules in terms of the reachability problem for directed hypergraphs. Using inseparability relations, we investigate the module-theoretic properties of reachability modules and show by means of an empirical evaluation that these modules have the potential of being substantially smaller than syntactic locality modules. © Springer-Verlag 2013.
Cite
CITATION STYLE
Nortje, R., Britz, K., & Meyer, T. (2013). Reachability modules for the description logic SRIQ. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8312 LNCS, pp. 636–652). https://doi.org/10.1007/978-3-642-45221-5_42
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
