Cardinality Restrictions on Concepts

From International Center for Computational Logic

Toggle side column

Cardinality Restrictions on Concepts

Franz BaaderFranz Baader,  M. BuchheitM. Buchheit,  B. HollunderB. Hollunder
Cardinality Restrictions on Concepts


Franz Baader, M. Buchheit, B. Hollunder
Cardinality Restrictions on Concepts
Proceedings of the German AI Conference, KI'94, volume 861 of Lecture Notes in Computer Science, 51-62, 1994. Springer
  • KurzfassungAbstract
    The concept description formalisms of existing terminological systems allow the user to express local cardinality restrictions on the fillers of a particular role. It is not possible, however, to introduce global restrictions on the number of instances of a given concept. This paper argues that such cardinality restrictions on concepts are of importance in applications such as configuration of technical systems, an application domain of terminological systems that is currently gaining in interest. It shows that including such restrictions into the description language leaves the important inference problems such as instance testing decidable. The algorithm combines and simplifies the ideas developed for the treatment of qualifying number restrictions and of general terminological axioms.
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
The final publication is available at Springer.
@inproceedings{ BaaderBuchheit+-KI-94,
  address = {Saarbr\"ucken (Germany)},
  author = {F. {Baader} and M. {Buchheit} and B. {Hollunder}},
  booktitle = {Proceedings of the German AI Conference, {KI'94}},
  pages = {51--62},
  publisher = {Springer--Verlag},
  series = {Lecture Notes in Computer Science},
  title = {Cardinality Restrictions on Concepts},
  volume = {861},
  year = {1994},
}