Elimination of Complex RIAs without Automata.
František Simančík · 2012
Abstract. We present an algorithm that eliminates complex role inclusion axioms (RIAs) from a SROIQ ontology preserving all logical consequences not involving non-simple roles. Unlike other existing methods, our algorithm does not explicitly construct finite automata recognizing the languages generated by the RIAs. Instead, it is formulated as a recursive expansion of universal restrictions, similar to well-known encodings of transitivity axioms. 1