Abstract
Matching of concepts with variables (concept patterns) is a relatively new operation that has been introduced in the context of concept description languages (description logics), originally to help filter out unimportant aspects of large concepts appearing in industrial-strength knowledge bases. This paper proposes a new approach to performing matching, based on a “concept-centered” normal form, rather than the more standard “structural subsumption” normal form for concepts. As a result, matching can be performed (in polynomial time) using arbitrary concept patterns of the description language FL¬, thus removing restrictions from previous work. The paper also addresses the question of matching problems with additional “side conditions”, which were motivated by practical experience.
Preview
Unable to display preview. Download preview PDF.
References
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, pages 446–451, Sydney, Australia, 1991.
F. Baader, M. Buchheit, and B. Hollunder. Cardinality restrictions on concepts. Artificial Intelligence, 88(1–2): 195–213, 1996.
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, pages 452–457, Sydney, Australia, 1991.
F. Baader and B. Hollunder. A terminological knowledge representation system with complete inference algorithms. In M. Richter and H. Boley, editors, Proceedings of the First International Workshop on Processing Declarative Knowledge, volume 567 of Lecture Notes in Computer Science, pages 67–85, Kaiserslautern (Germany), 1991. Springer-Verlag.
F. Baader and P. Narendran. Unification of concept terms in description logics. In H. Prade, editor, Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), pages 331–335, Brighton, UK, 1998. John Wiley & Sons Ltd. An extended version has appeared as Technical Report LTCS-98-06.
F. Baader and U. Sattler. Description logics with symbolic number restrictions. In W. Wahlster, editor, Proceedings of the Twelfth European Conference on Artificial Intelligence (ECAI-96), pages 283–287. John Wiley & Sons Ltd, 1996.
F. Baader and U. Sattler. Number restrictions on complex roles in description logics. In Proceedings of the Fifth International Conference on the Principles of Knowledge Representation and Reasoning (KR-96). Morgan Kaufmann, Los Altos, 1996.
A. Borgida. Description Logics in Data Management. IEEE Trans. on Knowledge and Data Engineering, 7(5): 671–682, 1995.
A. Borgida and D.L. McGuinness. Asking queries about frames. In Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning, KR'96, pages 340–349, Cambridge, MA (USA), 1996.
A. Borgida and P. Patel-Schneider. A semantics and complete algorithm for subsumption in the CLASSIC description logic. Journal of Artificial Intelligence Research, 1: 277–308, 1994.
R. J. Brachman, D. L. McGuinness, P. F. Patel-Schneider, L. A. Resnick, and A. Borgida. Living with CLASSIC: When and how to use a KL-ONE-like language. In J. Sowa, editor, Principles of Semantic Networks, pages 401–456. Morgan Kaufmann, San Mateo, Calif., 1991.
R. J. Brachman and J. G. Schmolze. An overview of the KL-ONE knowledge representation system. Cognitive Science, 9(2): 171–216, 1985.
M. Buchheit, F. M. Donini, and A. Schaerf. Decidable reasoning in terminological knowledge representation systems. Journal of Artificial Intelligence Research, 1: 109–138, 1993.
F. Donini, M. Lenzerini, D. Nardi, and W. Nutt. The complexity of concept languages. In Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning, pages 151–162, Cambridge, Mass., 1991.
F. Donini, M. Lenzerini, D. Nardi, and W. Nutt. Tractable concept languages. In Proceedings of the 12th International Joint Conference on Artificial Intelligence, pages 458–463, Sydney, Australia, 1991.
F. Donini, M. Lenzerini, D. Nardi, and A. Schaerf. Deduction in concept languages: From subsumption to instance checking. Journal of Logic and Computation, 4(4): 423–452, 1994.
F.M. Donini, B. Hollunder, M. Lenzerini, A.M. Spaccamela, D. Nardi, and W. Nutt. The complexity of existential quantification in concept languages. Journal of Artificial Intelligence, 53: 309–327, 1992.
M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.
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, pages 335–346, Cambridge, Mass., 1991.
B. Hollunder, W. Nutt, and M. Schmidt-Schauß. Subsumption algorithms for concept description languages. In Proceedings of the 9th European Conference on Artificial Intelligence, pages 348–353, Stockholm, Sweden, 1990.
R. Küsters. Characterizing the semantics of terminological cycles in ALN using finite automata. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), Trento, Italy, 1998.
H. J. Levesque and R. J. Brachman. Expressiveness and tractability in knowledge representation and reasoning. Computational Intelligence, 3: 78–93, 1987.
D.L. McGuinness. Explaining Reasoning in Description Logics. Ph.D. thesis, Department of Computer Science, Rutgers University, October 1996. Also available as a Rutgers Technical Report LCSR-TR-277.
D.L. McGuinness and A. Borgida. Explaining subsumption in Description Logic. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, IJCAI'95, pages 816–821, Montréal, Canada, 1995. Morgan Kaufmann.
D.L. McGuinness, L. Alperin Resnick, and C. Isbell. Description Logic in practice: A classic application. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, IJCAI'95, pages 2045–2046, Montréal, Canada, 1995. Morgan Kaufmann. Video Presentation.
D.L. McGuinness and J.R. Wright. An industrial strength Description Logic-based configurator platform. IEEE Expert, Special Issue on Configuration, 1998. To appear.
B. Nebel. Computational complexity of terminological reasoning in BACK. Journal of Artificial Intelligence, 34(3): 371–383, 1988.
B. Nebel. Reasoning and Revision in Hybrid Representation Systems, volume 422 of Lecture Notes in Computer Science. Springer-Verlag, 1990.
B. Nebel. Terminological reasoning is inherently intractable. Journal of Artificial Intelligence, 43(2): 235–249, 1990.
A. Schaerf. On the complexity of the instance checking problem in concept languages with existential quantification. Journal of Intelligent Information Systems, 2: 265–278, 1993.
M. Schmidt-Schauß and G. Smolka. Attributive concept descriptions with complements. Journal of Artificial Intelligence, 47: 1–26, 1991.
W. A. Woods and J. G. Schmolze. The KL-ONE family. Computers and Mathematics with Applications, special issue on knowledge representation, 23(2–5): 133–177, 1991.
J. R. Wright, E. S. Weixelbaum, G. T. Vesonder, K. Brown, 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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baader, F., Borgida, A., McGuinness, D.L. (1998). Matching in description logics: Preliminary results. In: Mugnier, ML., Chein, M. (eds) Conceptual Structures: Theory, Tools and Applications. ICCS 1998. Lecture Notes in Computer Science, vol 1453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054902
Download citation
DOI: https://doi.org/10.1007/BFb0054902
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64791-1
Online ISBN: 978-3-540-68673-6
eBook Packages: Springer Book Archive