Advertisement

Querying concept-based knowledge bases

  • Maurizio Lenzerini
  • Andrea Schaerf
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 567)

Abstract

Much of the research on terminological reasoning aims at characterizing concept languages (also called terminological languages) with respect to both expressive power and computational complexity of computing subsumption. On the other hand, little attention has been paid to studying concept languages as query languages, i.e. as a means for extracting information from a concept-based knowledge base. In this paper we address this problem by exploring the possibility of using two different concept languages, one for asserting facts about individual objects, and the other for querying a set of such assertions. Contrary to many negative results on the complexity of terminological reasoning, our work shows that, provided that a limited language is used for the assertions, it is possible to employ a richer query language while keeping the reasoning process tractable. We also show that, on the other hand, there are constructs that make query answering inherently intractable.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BBMR89]
    A. Borgida, R. J. Brachman, D. L. McGuinness, L. A. Resnick. “CLASSIC: A Structural Data Model for Objects.” Proceeding of ACM SIGMOD-89, 1989.Google Scholar
  2. [BL84]
    R. J. Brachman, H. J. Levesque. “The Tractability of Subsumption in Frame-based Description Languages.” Proceedings of the 4th National Conference of the AAAI, 1984.Google Scholar
  3. [DHL91]
    F. Donini, B. Hollunder, M. Lenzerini, A. Marchetti Spaccamela, D. Nardi, W. Nutt. “The Complexity of Existential Quantification in Terminological Reasoning”, DFKI-Report, DFKI, Postfach 2080, D-6750 Kaiserslautern, West Germany. Submitted for publication, 1991.Google Scholar
  4. [DLN90]
    F. Donini, M. Lenzerini, D. Nardi, “An Efficient Method for Hybrid Deduction”, Proceedings of European Conference on Artificial Intelligence, ECAI, 1990.Google Scholar
  5. [DLN91a]
    F. Donini, M. Lenzerini, D. Nardi, W. Nutt. “The Complexity of Concept Languages.” Proceedings of the 2nd International Conference on Knowledge Representation and Reasoning, KR, 1991.Google Scholar
  6. [DLN91b]
    F. Donini, M. Lenzerini, D. Nardi, W. Nutt. “Tractable Concept Languages.” Proceedings of the 12th International Joint Conference on Artificial Intelligence, IJCAI, 1991.Google Scholar
  7. [H90]
    B. Hollunder, “Hybrid Inference in KL-ONE-based Knowledge Representation Systems.” German National Conference on Artificial Intelligence, 1990.Google Scholar
  8. [LS91a]
    M. Lenzerini, A. Schaerf. “Concept Languages as Query Languages.” Proceedings of the 9th National Conference of the American Association for Artificial Intelligence, AAAI, 1991.Google Scholar
  9. [LS91b]
    M. Lenzerini, A. Schaerf. “Concept Languages as Query Languages.” Technical Report, Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”.Google Scholar
  10. [L81]
    H. J. Levesque. “The Interaction with Incomplete Knowledge Bases: a Formal Treatment.” Proceedings of 7th International Joint Conference on Artificial Intelligence, IJCAI, 1981.Google Scholar
  11. [Neb88]
    B. Nebel. “Computational Complexity of Terminological Reasoning in BACK.” Artificial Intelligence, 34(3):371–383, 1988.CrossRefMathSciNetGoogle Scholar
  12. [NS89]
    B. Nebel, G. Smolka. “Representation and Reasoning with Attributive Descriptions.” IWBS Report 81, IBM Deutschland, Stuttgart, W. Germany, 1989.Google Scholar
  13. [SS91]
    M. Schmidt-Schauß, G. Smolka. “Attributive Concept Descriptions with Unions and Complements.” Artificial Intelligence, 48(1):1–26, 1991.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Maurizio Lenzerini
    • 1
  • Andrea Schaerf
    • 1
  1. 1.Dipartimento di Informatica e SistemisticaUniversità di Roma “La Sapienza”RomaItalia

Personalised recommendations