User Tools

Site Tools


Structural Subsumption Considered from an Automata Theoretic Point of View (BibTeX)

@TECHREPORT{BaaderKuestersMolitor-LTCS-98-04-1998,
  author = {F. Baader and R. K{\"u}sters and R. Molitor},
  title = {{Structural Subsumption Considered from an Automata Theoretic Point of View}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  year = 1998,
  type = {LTCS-Report},
  number = {LTCS-98-04},
  address = {Germany},
  issuedate = {June 1998},
  note = {See \url{http://www.informatik.rwth-aachen.de/Forschung/aib.php}.},
  abstract = {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.}
}