Abstract
The knowledge representation system kl-one first appeared in 1977. Since then many systems based on the idea of kl-one have been built. The formal model-theoretic semantics which has been introduced for kl-one languages [BL84] provides means for investigating soundness and completeness of inference algorithms. It turned out that almost all implemented kl-one systems such as back, kl-two, loom, nikl, sb-one use sound but incomplete algorithms.
Until recently, sound and complete algorithms for the basic reasoning facilities in these systems such as consistency checking, subsumption checking (classification) and realization were only known for rather trivial languages. However, in the last two years concept languages (term subsumption languages) have been thoroughly investigated (see for example [SS88, Neb90, HNS90, DLNN91]). As a result of these investigations it is now possible to provide sound and complete algorithms for relatively large concept languages.
In this paper we describe KRIS which is an implemented prototype of a kl-one system where all reasoning facilities are realized by sound and complete algorithms. This system can be used to investigate the behaviour of sound and complete algorithms in practical applications. Hopefully, this may shed a new light on the usefulness of complete algorithms for practical applications, even if their worst case complexity is NP or worse.
KRIS provides a very expressive concept language, an assertional language, and sound and complete algorithms for reasoning. We have chosen the concept language such that it contains most of the constructs used in kl-one systems with the obvious restriction that the interesting inferences such as consistency checking, subsumption checking, and realization are decidable. The assertional language is similar to languages normally used in such systems. The reasoning component of KRIS depends on sound and complete algorithms for reasoning facilities such as consistency checking, subsumption checking, retrieval, and querying.
Preview
Unable to display preview. Download preview PDF.
References
F. Baader. “Terminological Cycles in kl-one-based Knowledge Representation Languages.” In Proceedings of the 8th National Conference of the AAAI, pp. 621–626, Boston, Mas., 1990.
F. Baader. “A Formal Definition for the Expressive Power of Knowledge Representation Languages.” In Proceedings of the 9th European Conference on Artificial Intelligence, pp. 53–58, Stockholm, Sweden, 1990.
F. Baader. “Augmenting Concept Languages by Transitive Closure of Roles: An Alternative to Terminological Cycles.” To appear in Proceedings of IJCAI '91.
F. Baader, H.-J. Bürckert, J. Heinsohn, B. Hollunder, J. Müller, B. Nebel, W. Nutt, H.-J. Profitlich. Terminological Knowledge Representation: A Proposal for a Terminological Logic DFKI Technical Memo TM-90-04, DFKI, Postfach 2080, D-6750 Kaiserslautern, Germany.
F. Baader, H.-J. Bürckert, B. Hollunder, W. Nutt, J. H. Siekmann. “Concept Logics” In Proceedings of the Symposium on Computational Logics, Brüssel, November 1990.
F. Baader, P. Hanschke. “A Schema for Integrating Concrete Domains into Concept Languages.” To appear in Proceedings of IJCAI '91.
A. Borgida, R. J. Brachman, D. L. McGuinness, L. A. Resnick. “CLASSIC: A Structural Data Model for Objects.” In Proceedings of the International Conference on Management of Data, Portland, Oregon, 1989.
R. J. Brachman, V. Pigman Gilbert, H. J. Levesque. “An essential hybrid reasoning system: knowledge and symbol level accounts in KRYPTON.” In Proceedings of the 9th IJCAI, pp. 532–539, Los Angeles, Cal., 1985.
R. J. Brachmann, H. J. Levesque. “The tractability of subsumption in frame based description languages.” In Proceedings of the 4th National Conference of the AAAI, pp. 34–37, Austin, Tex., 1984.
R. J. Brachman, J. G. Schmolze. “An Overview of the kl-one knowledge representation system.” Cognitive Science, 9(2):171–216, April 1985.
H.-J. Bürckert. “A Resolution Principle for Clauses with Constraints” In Proceedings of the 10th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, LNAI 449, Springer Verlag, pp. 178–192,1990.
H.-J. Bürckert, J. Müller. “RATMAN: A Rational Agent Testbed for Multi Agent Networks”, In Proceedings of Modeling Autonomous Agents in Multi-Agent Worlds, Elsevier Publishers, 1991.
F. Donini, M. Lenzerini, D. Nardi, W. Nutt. “The Complexity of Concept Languages.” In J. A. Allan, R. Fikes, E. Sandewall (editors), Proceedings of the Second International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, Mas., 1991.
B. Hollunder. “Hybrid Inferences in kl-one-based Knowledge Representation Systems.” In Proceedings of the 14th German Workshop on Artificial Intelligence, pp. 38–47, Eringerfeld, Germany, 1990.
B. Hollunder, F. Baader. “Qualifying Number Restrictions in Concept Languages.” In J. A. Allan, R. Fikes, E. Sandewall (editors), Proceedings of the Second International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, Mas., 1991.
B. Hollunder, W. Nutt. Subsumption Algorithms for Concept Description Languages. DFKI Research Report RR-90-04, DFKI, Postfach 2080, D-6750 Kaiserslautern, Germany.
B. Hollunder, W. Nutt, M. Schmidt-Schauß. “Subsumption Algorithms for Concept Description Languages.” In Proceedings of the 9th European Conference on Artificial Intelligence, pp. 348–353, Stockholm, Sweden, 1990.
T. S. Kaczmarek, R. Bates, G. Robins. “Recent developments in NIKL.” In Proceedings of the 5th National Conference of the AAAI, pp. 578–587, Philadelphia, Pa., 1986.
A. Kobsa. “The sb-one knowledge representation workbanch” In Preprints of the Workshop on Formal Aspects of Semantic Networks, Two Harbors, Cal., February 1989.
H. J. Levesque, R. J. Brachman. “Expressiveness and tractability in knowledge representation and reasoning.” Computational Intelligence, 3:78–93, 1987.
R. MacGregor, R. Bates. The Loom Knowledge Representation Language. Technical Report ISI/RS-87-188, University of Southern California, Information Science Institute, Marina del Rey, Cal., 1987.
B. Nebel. Reasoning and Revision in Hybrid Representation Systems, Lecture Notes in Artificial Intelligence, LNAI 422, Springer Verlag, 1990.
B. Nebel. “Terminological Cycles: Semantics and Computational Properties.” In Proceedings of the Workshop on Formal Aspects of Semantic Networks, Two Harbors, Cal., February 1989.
B. Nebel. “Computational complexity of terminological reasoning in BACK.” Artificial Intelligence, 34(3):371–383, 1988.
B. Nebel, K. von Luck. “Hybrid Reasoning in BACK.” In Z. W. Ras, L. Saitta (editors), Methodologies for Intelligent Systems, pp. 260–269, North Holland, Amsterdam, Netherlands, 1988.
P. Patel-Schneider. “Small can be beautiful in knowledge representation.” In Proceedings of the IEEE Workshop on Principles of Knowledge-Based Systems, pp. 11–16, Denver, Colo., 1984.
P. Patel-Schneider. “A four-valued Semantics for Terminological Logics.” Artificial Intelligence, 39(2):263–272, 1989.
P. Patel-Schneider, B. Owsnicki-Klewe, A. Kobsa, N. Guarino, R. MacGregor, W. S. Mark, D. L. McGuinness, B. Nebel, A. Schmiedel, J. Yen. “Term Subsumption in Knowledge Representation.” In AI Magazine, 11(2):16–23, 1990. pp. 11–16, Denver, Colo., 1984.
M. Schmidt-Schauß. “Subsumption in KL-ONE is undecidable.” In R. J. Brachmann, H. J. Levesque, R. Reiter (editors), Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning, pp. 421–431, Toronto, Ont., 1989.
M. Schmidt-Schauß, G. Smolka. “Attributive Concept Descriptions with Complements”. Artificial Intelligence, 47, 1991.
M. B. Vilain. “The restricted language architecture of a hybrid representation system.” In R. J. Bachmann, H. J. Levesque, R. Reiter (editors), Proceedings of the 9th IJCAI, pp. 547–551, Los Angeles, Cal., 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baader, F., Hollunder, B. (1991). A terminological knowledge representation system with complete inference algorithms. In: Boley, H., Richter, M.M. (eds) Processing Declarative Knowledge. PDK 1991. Lecture Notes in Computer Science, vol 567. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013522
Download citation
DOI: https://doi.org/10.1007/BFb0013522
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55033-4
Online ISBN: 978-3-540-46667-3
eBook Packages: Springer Book Archive