Abstract
We shall consider an application in mechanical engineering, and shall show that the adequate modelling of the terminology of this problem domain in a conventional concept language poses two main representation problems. The first requires access to concrete domains, such as real numbers, while the second asks for a construct which can be used to represent sequences of varying length. As shown in recent papers by the authors there exist extended concept languages—equipped with sound and complete reasoning algorithms—that satisfy the respective representation demands separately.
The main result presented in this paper is that the combination of both extensions leads to undecidable terminological inference problems. In particular, the important subsumption problem is undecidable. It should be noted that the need for these extensions is not particular to the considered problem domain; similar representation demands are likely to occur in other non-toy applications.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Supported by BMFT Research Project AKA-WINO (grant ITW 8903 0)
Supported by BMFT Research Project ARC-TEC (grant ITW 8902 C4)
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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, 1991. A long version is available as DFKI Research Report RR-91-10.
F. Baader. Terminological cycles in Kl-one-based knowledge representation languages. In Proceedings of the Eighth National Conference on Artificial Intelligence, volume 2, pages 621–626. AAAI, 1990. A long version is available as DFKI Research Report RR-90-01.
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, 1991. A long version is available as DFKI Research Report RR-90-13.
A. Borgida, R. J. Brachman, D. L. McGuinness, and L. A. Resnick. CLASSIC: A structural data model for objects. In International Conference on Management of Data. ACM SIGMOD, 1989.
R. J. Brachman and J. G. Schmolze. An overview of the Kl-one knowledge representation system. Cognitive Science, 9(2):171–216, 1985.
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, Cambrige, MA, 1979. Bolt Beranek and Newman.
G. E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In 2nd Conference on Automata Theory & Formal Languages, volume 33 of LNCS, 1975.
F. Donini, B. Hollunder, M. Lenzerini, A. M. Spaccamela, D. Nardi, and W. Nutt. The complexity of existential quantificatoin in concept languages. Research Report RR-91-02, DFKI, 1991.
J. Edelmann and B. Owsnicki. Data models in knowledge representation systems: a case study. In GWAI-86 und 2. östereichische Artificial-Intelligence-Tagung, volume 124 of Informatik-Fachberichte, pages 69–74. Springer, 1986.
Ph. Hanschke and F. Baader. Terminological reasoning in a mechanical-engineering domain. In Workshop on Terminological Logics, Berlin. KIT-Report, 1991.
Ph. Hanschke and K. Hinkelmann. Combining terminological and rule-based reasoning for abstraction processes. In GWAI'92. Springer, 1992.
B. Hollunder, W. Nutt, and M. Schmidt-Schauß. Subsumption algorithms for concept description languages. In 9th European Conference on Artificial Intelligence (ECAI'90), pages 348–353, 1990.
B. Hollunder. Hybrid inferences in Kl-one-based knowledge representation systems. In GWAI-90; 14th German Workshop on Artificial Intelligence, volume 251 of Informatik-Fachberichte, pages 38–47. Springer, 1990.
Ch. Klauck, R. Legleitner, and A. Bernardi. FEAT-REP: Representing features in CAD/CAM. In 4th International Symposium on Artificial Intelligence: Applications in Informatics, Cancun, Mexiko, 1991. A long version is available as DFKI Research Report RR-91-20.
A. Kobsa. The sb-one knowledge representation workbench. In Preprints of the Workshop on Formal Aspects of Semantic Networks, 1989. Harbors, Cal.
R. Loos and V. Weispfenning. Applying linear quantifier elimination. Technical Report, Wilhelm Schickard-Institut für Informatik, Universität Tübingen, Germany, 1990.
E. Mays, C. Apté, J. Griesmer, and J. Kastner. Organizing knowledge in a complex financial domain. IEEE Expert, 2(3):61–70, 1987.
E. Mays, C. Apté, J. Griesmer, and J. Kastner. Experience with K-Rep: an object centered knowledge representation language. In Proceedings of IEEE CAIA-88, pages 62–67, 1988.
B. Nebel. Terminological cycles: Semantics and computational properties. In Proceedings of the Workshop on Formal Aspects of Semantic Networks, 1989. Two Harbors, Cal.
Bernhard Nebel. Reasoning and Revision in Hybrid Representation Systems, volume 422 of LNAI. Springer, 1990.
E. M. Post. A variant of a recursively unsolvable problem. Bull. Am. Math. Soc., 52:264–268, 1946.
M. Schmidt-Schauß and G. Smolka. Attributive concept descriptions with complements. Journal of Artificial Intelligence, 47, 1991.
A. Tarski. A Decision Method for Elementary Algebra and Geometry. U. of California Press. Berkley, 1951.
V. Weispfenning. The complexity of linear problems in fields. J. Symbolic Computation, 5:3–27, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baader, F., Hanschke, P. (1993). Extensions of concept languages for a mechanical engineering application. In: Jürgen Ohlbach, H. (eds) GWAI-92: Advances in Artificial Intelligence. Lecture Notes in Computer Science, vol 671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018999
Download citation
DOI: https://doi.org/10.1007/BFb0018999
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56667-0
Online ISBN: 978-3-540-47626-9
eBook Packages: Springer Book Archive