Structural Subsumption Considered from an Automata Theoretic Point of View

Franz BaaderFranz Baader, R. KüstersR. Küsters, R. MolitorR. Molitor

Datei:BaaderKuestersMolitor-LTCS-98-04.ps.gz

Download

Franz Baader, R. Küsters, R. Molitor
Structural Subsumption Considered from an Automata Theoretic Point of View
Technical Report, LuFG Theoretical Computer Science, RWTH Aachen, volume LTCS-98-04, 1998. LTCS-Report

Details
Bibtex

KurzfassungAbstract
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.
Bemerkung: Note: See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@techreport{ BaaderKuestersMolitor-LTCS-98-04,
  address = {Germany},
  author = {F. {Baader} and R. {K{\"u}sters} and R. {Molitor}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.},
  number = {LTCS-98-04},
  title = {Structural Subsumption Considered from an Automata Theoretic Point of View},
  type = {LTCS-Report},
  year = {1998},
}