Structural Subsumption Considered from an Automata-Theoretic Point of View
Franz Baader, Ralf Küsters, Ralf Molitor · 1998
This paper compares two approaches for deriving subsumption algorithms for the description logic ALN: structural subsumption and an automata-theoretic characterization of subsumption.It turns out that structural subsumption algorithms can be seen as special implementations of the automata-theoretic characterization.