Unification in a Description Logic with Inconsistency and Transitive Closure of Roles

From International Center for Computational Logic

Toggle side column

Unification in a Description Logic with Inconsistency and Transitive Closure of Roles

Franz BaaderFranz Baader,  R. KüstersR. Küsters
Franz Baader, R. Küsters
Unification in a Description Logic with Inconsistency and Transitive Closure of Roles
In I. Horrocks and S. Tessaris, eds., Proceedings of the 2002 International Workshop on Description Logics, 2002
  • KurzfassungAbstract
    Unification considers concept patterns, i.e., concept descriptions with variables, and tries to make these descriptions equivalent by replacing the variables by appropriate concept descriptions. In a previous paper, we have shown that unification in FLreg, a description logic that allows for the concept constructors top concept, concept conjunction, and value restrictions as well as the role constructors union, composition, and transitive closure, is an ExpTime-complete problem and that solvable FLreg-unification problems always have least unifiers. In the present paper, we generalize these results to a DL which extends FLreg by the bottom concept. The proof strongly depends on the existence of least unifiers in FLreg.
  • Bemerkung: Note: See http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-53/
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ BaaderKuestersDL02,
  address = {Toulouse, France},
  author = {F. {Baader} and R. {K\"usters}},
  booktitle = {Proceedings of the 2002 International Workshop on Description Logics},
  editor = {I. {Horrocks} and S. {Tessaris}},
  note = {See http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-53/},
  title = {Unification in a Description Logic with Inconsistency and Transitive Closure of Roles},
  year = {2002},
}