Rewriting Concepts Using Terminologies

From International Center for Computational Logic

Toggle side column

Rewriting Concepts Using Terminologies

Franz BaaderFranz Baader,  R. MolitorR. Molitor
Franz Baader, R. Molitor
Rewriting Concepts Using Terminologies
In P. Lambrix and A. Borgida and M. Lenzerini and R. Möller and P. Patel-Schneider, eds., Proceedings of the International Workshop on Description Logics 1999 (DL'99), CEUR-WS, 1999. Linköping University
  • KurzfassungAbstract
    In this work we consider the inference problem of computing (minimal) rewritings of concept descriptions using defined concepts from a terminology. We introduce a general framework for this problem and instantiate it with the small description logic FLo, which provides us with conjunction and value restrictions. We show that the decision problem induced by the minimal rewriting problem is NP-complete for FLo.
  • Bemerkung: Note: Proceedings online available from http://SunSITE.Informatik.RWTH-Aachen.DE/Publications/CEUR-WS/Vol-22/
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ BaaderMolitor-DL-1999,
  address = {Sweden},
  author = {F. {Baader} and R. {Molitor}},
  booktitle = {Proceedings of the International Workshop on Description Logics 1999 (DL'99)},
  editor = {P. {Lambrix} and A. {Borgida} and M. {Lenzerini} and R. {M{\"o}ller} and P. {Patel-Schneider}},
  note = {Proceedings online available from {http://SunSITE.Informatik.RWTH-Aachen.DE/Publications/CEUR-WS/Vol-22/}},
  number = {22},
  publisher = {Link{\"o}ping University},
  series = {CEUR-WS},
  title = {Rewriting Concepts Using Terminologies},
  year = {1999},
}