An example of axiom-splitting rules is found in a computational complexity proof for the description logic EL+ (Baader et al., 2005), which requires class inclusion axioms to be rewritten to a maximally simple 'normal form' permitting only four patterns: A 2 , where P and all A N are atomic terms.
this simplification of axiom structure can be achieved only by introducing new atomic terms.