Description Logics with Symbolic Number Restrictions

Aus International Center for Computational Logic
Version vom 19. März 2015, 18:44 Uhr von Marcel Lippmann (Diskussion | Beiträge)
(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Wechseln zu:Navigation, Suche

Toggle side column

Description Logics with Symbolic Number Restrictions

F. BaaderF. Baader,  U. SattlerU. Sattler
F. Baader, U. Sattler
Description Logics with Symbolic Number Restrictions
In W. {Wahlster}, eds., Proceedings of the Twelfth European Conference on Artificial Intelligence (ECAI-96), 283--287, 1996. John Wiley \& Sons Ltd
  • KurzfassungAbstract
    Motivated by a chemical engineering application,

    we introduce an extension of the concept description language ALCN by symbolic number restrictions. This first extension turns out to have an undecidable concept satisfiability problem. For a restricted language-whose expressive power is sufficient for our application-we show that concept

    satisfiability is decidable.
  • Bemerkung: Note: An extended version has appeared as Technical Report LTCS-96-03
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ BaSat95,
  author = {F. {Baader} and U. {Sattler}},
  booktitle = {Proceedings of the Twelfth European Conference on Artificial Intelligence (ECAI-96)},
  editor = {W. {Wahlster}},
  note = {An extended version has appeared as Technical Report LTCS-96-03},
  pages = {283--287},
  publisher = {John Wiley \& Sons Ltd},
  title = {Description Logics with Symbolic Number Restrictions},
  year = {1996},
}