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 inseperability 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.
Reference:
Nortje, R, Britz, K and Meyer, T. 2013. Reachability modules for the description logic SRIQ. In: Logic for Programming, Artificial Intelligence, and Reasoning (LPAR) 19 Conference, 14-19 December 2013, Stellenbosch, South Africa
Nortje, R., Britz, K., & Meyer, T. (2013). Reachability modules for the description logic SRIQ. Springer Verlag. http://hdl.handle.net/10204/7391
Nortje, R, K Britz, and T Meyer. "Reachability modules for the description logic SRIQ." (2013): http://hdl.handle.net/10204/7391
Nortje R, Britz K, Meyer T, Reachability modules for the description logic SRIQ; Springer Verlag; 2013. http://hdl.handle.net/10204/7391 .
