User Tools

Site Tools


Unification in a Description Logic with Transitive Closure of Roles (BibTeX)

@INPROCEEDINGS{BaaderKuesters-LPAR-2001,
  author = {F.~Baader and R.~K{\"u}sters},
  title = {{Unification in a Description Logic with Transitive Closure of Roles}},
  booktitle = {Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2001)},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Artificial Intelligence},
  address = {Vienna, Austria},
  year = 2001,
  editor = {R.~Nieuwenhuis and A.~Voronkov},
  volume = 2250,
  abstract = {Unification of concept descriptions was introduced by Baader and Narendran as a tool for detecting redundancies in knowledge bases. It was shown that unification in the small description logic FL0, which allows for conjunction, value restriction, and the top concept only, is already ExpTime-complete.  The present paper shows that the complexity does not increase if one additionally allows for composition, union, and transitive closure of roles.  It also shows that matching (which is polynomial in FL0) is PSpace-complete in the extended description logic.  These results are proved via a reduction to linear equations over regular languages, which are then solved using automata.  The obtained results are also of interest in formal language theory.}
}