Description Logics with Aggregates and Concrete Domains

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 Aggregates and Concrete Domains

F. BaaderF. Baader,  U. SattlerU. Sattler
F. Baader, U. Sattler
Description Logics with Aggregates and Concrete Domains
Technical Report, LuFg Theoretical Computer Science, RWTH Aachen, Germany, volume LTCS-97-01, 1997. LTCS-Report
  • KurzfassungAbstract
    We show that extending description logics by simple aggregation functions

    as available in database systems may lead to undecidability of inference problems

    such as satisfiability and subsumption.
  • Bemerkung: Note: An abridged version has appeared in the Proceedings of the International Workshop on Description Logics 97.
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@techreport{ BaSat97,
  author = {F. {Baader} and U. {Sattler}},
  institution = {LuFg Theoretical Computer Science, RWTH Aachen, Germany},
  note = {An abridged version has appeared in the Proceedings of the International Workshop on Description Logics 97.},
  number = {LTCS-97-01},
  title = {Description Logics with Aggregates and Concrete Domains},
  type = {LTCS-Report},
  year = {1997},
}