Finding EL+ justications using the Earley parsing algorithm

Nortje, R., Britz, K. and Meyer, T.

Module extraction plays an important role in the reuse of ontologies as well as in the simpli cation and optimization of some reasoning tasks such as nding justi cations for entailments. In this paper we focus on the problem of extracting small modules for EL+ entailment based on reachability. We extend the current notion of (forward) reachability to obtain a bi-directional version, and show that the bidirectional reachability algorithm allows us to transform an EL+ ontology into a reachability preserving context free grammar (CFG). The well known Earley algorithm for parsing strings, given some CFG, is then applied to the problem of extracting minimal reachability-based axioms sets for subsumption entailments. We show that each reachability-based axiom set produced by the Earley algorithm corresponds to a possible Minimal Axiom Set (MinA) that preserves the given entailment. This approach has two advantages { it has the potential to reduce the number of subsumption tests performed during MinA extraction, as well to minimize the number of axioms for each such test.

Cite as: Nortje, R., Britz, K. and Meyer, T. (2009). Finding EL+ justications using the Earley parsing algorithm. In Proc. Australasian Ontology Workshop 2009 (AOW 2009) Melbourne, Australia. CRPIT, 112. Meyer, T. and Taylor, K. Eds., ACS. 27-35

(from crpit.com) (local if available)