Skip to main content

Cardinality restrictions on concepts

  • Selected Papers
  • Conference paper
  • First Online:
KI-94: Advances in Artificial Intelligence (KI 1994)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 861))

Included in the following conference series:

Abstract

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.

This work was partly supported by the German Ministry of Research and Technology under grant ITW 92-01 (TACOS).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Baader. Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles. In Proceedings of the 12th International Joint Conference on Artificial Intelligence, Sydney, Australia, 1991.

    Google Scholar 

  2. F. Baader, M. Buchheit, and B. Hollunder. Cardinality restrictions on concepts. Research Report RR-93-48, DFKI Saarbrücken, 1993.

    Google Scholar 

  3. F. Baader, H.-J. Bürckert, B. Hollunder, W. Nutt, and J. H. Siekmann. Concept logics. In Proceedings of the Symposium on Computational Logics, Brüssel, Belgium, 1990.

    Google Scholar 

  4. F. Baader and P. Hanschke. A scheme for integrating concrete domains into concept languages. In Proceedings of the 12th International Joint Conference on Artificial Intelligence, Sydney, Australia, 1991.

    Google Scholar 

  5. F. Baader and B. Hollunder. A terminological knowledge representation system with complete inference algorithms. In M. Richter and H. Boley, editors, International Workshop on Processing Declarative Knowledge, volume 567. Springer, 1991.

    Google Scholar 

  6. C. Bagnasco, P. Petrin, and L. Spampinato. Taxonomic reasoning in configuration tasks. Technical Report QR-91-1, Quinary SpA, 1991.

    Google Scholar 

  7. J. Barwise and R. Cooper. Generalized quantifiers and natural language. Linguistics and Philosophy, 4:159–219, 1981.

    Google Scholar 

  8. R. J. Brachman, R. J. Bobrow, P. R. Cohen, J. W. Klovstad, B. L. Webber, and W. A. Woods. Research in natural language understanding, annual report. Technical Report No. 4274. Bolt, Beranek and Newman, Cambridge, Mass., 1979.

    Google Scholar 

  9. M. Buchheit, F. M. Donini, and A. Schaerf. Decidable reasoning in terminological knowledge representation systems. Journal of Artificial Intelligence Research, 1:109–138, 1993.

    Google Scholar 

  10. B. Hollunder and F. Baader. Qualifying number restrictions in concept languages. In Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, Mass., 1991.

    Google Scholar 

  11. R. Klein. Model representation and taxonomic reasoning in configuration problem solving. In Proceedings of the German Workshop on Artificial Intelligence, GWAI-91, 1991.

    Google Scholar 

  12. R. Klein, M. Buchheit, and W. Nutt. Configuration as model construction: The constructive problem solving approach. In Proceedings of the Third International Conference on Artificial Intelligence in Design, Lausanne, Switzerland, 1994.

    Google Scholar 

  13. B. Owsnicki-Klewe. Configuration as a consistency maintenance task. In Proceedings of the German Workshop on Artificial Intelligence, GWAI-88, 1988.

    Google Scholar 

  14. J. Quantz. How to fit generalized quantifiers into terminological logics. In Proceedings of the 10th European Conference on Artificial Intelligence, pages 543–547, Vienna, Austria, 1992.

    Google Scholar 

  15. K. Schild. Terminological cycles and the propositional μ-calculus. In Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning, Bonn, Germany, 1994.

    Google Scholar 

  16. W. van der Hoek and M. de Rijke. Generalized quantifiers and modal logic. Journal of logic, language and information, 2:19–58, 1993.

    Google Scholar 

  17. J. R. Wright, E. S. Weixelbaum, K. Brown, G. T. Vesonder, S. R. Palmer, J. I. Berman, and H. H. Moore. A knowledge-based configurator that supports sales, engineering, and manufacturing at AT&T network systems. AI Magazine, 14(3): 69–80, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Bernhard Nebel Leonie Dreschler-Fischer

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baader, F., Buchheit, M., Hollunder, B. (1994). Cardinality restrictions on concepts. In: Nebel, B., Dreschler-Fischer, L. (eds) KI-94: Advances in Artificial Intelligence. KI 1994. Lecture Notes in Computer Science, vol 861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58467-6_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-58467-6_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58467-4

  • Online ISBN: 978-3-540-48979-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics