Extensions of Concept Languages for a Mechanical Engineering Application

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.

[1]  Frank Berger,et al.  Planbasierte graphische Hilfe in objektorientierten Benutzungsoberflächen , 1992 .

[2]  Franz Baader,et al.  Terminological Cycles in KL-ONE-based Knowledge Representation Languages , 1990, AAAI.

[3]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[4]  Holger Peine.  An investigation of the applicability of terminological reasoning to application-independent software-analysis , 1992 .

[5]  Hans Uszkoreit,et al.  Linking Typed Feature Formalisms and Terminological Knowledge Representation Languages in Natural Language Front-Ends , 1991, Wissensbasierte Systeme.

[6]  Bernd Owsnicki-Klewe,et al.  Data Models in Knowledge Representation System: A Case Study , 1986, GWAI.

[7]  Ansgar Bernardi,et al.  ARC-TEC : acquisition, representation and compilation of technical knowledge , 1991 .

[8]  Gabriele Schmidt.  Knowledge Acquisition from Text in a Complex Domain , 1992, IEA/AIE.

[9]  Alfred Kobsa,et al.  Utilizing Knowledge: The Components of the SB-ONE Knowledge Representation Workbench , 1991, Principles of Semantic Networks.

[10]  Ronald J. Brachman,et al.  Research in Natural Language Understanding , 1978 .

[11]  Ansgar Bernardi,et al.  FEAT-REP : representing features in CAD/CAM , 1991 .

[12]  Ronald J. Brachman,et al.  An Overview of the KL-ONE Knowledge Representation System , 1985, Cogn. Sci..

[13]  C. Apte,et al.  Experience with K-REP: an object-centered knowledge representation language , 1988, [1988] Proceedings. The Fourth Conference on Artificial Intelligence Applications.

[14]  Gert Smolka,et al.  A Feature-Based Constraint System for Logic Programming with Entailment , 1992, FGCS.

[15]  Franz Baader.  Augmenting Concept Languages by Transitive Closure of Roles: An Alternative to Terminological Cycles , 1991, IJCAI.

[16]  John Nerbonne,et al.  Constraint-based semantics , 1992 .

[17]  Knut Hinkelmann.  Forward logic evaluation : developing a compiler from a partially evaluated meta interpreter , 1991 .

[18]  Franz Schmalhofer,et al.  Integrated knowledge acquisition for lathe production planning : a picture gallery , 1992 .

[19]  Bernhard Nebel,et al.  An Empirical Analysis of Terminological Representation Systems , 1992, Artif. Intell..

[20]  Jana Koehler,et al.  Deductive Planning and Plan Reuse in a Command Language Environment , 1992, ECAI.

[21]  Gert Smolka,et al.  Attributive Concept Descriptions with Complements , 1991, Artif. Intell..

[22]  Bernhard Hollunder.  Hybrid Inferences in KL-ONE-Based Knowledge Representation Systems , 1990, GWAI.

[23]  Ansgar Bernardi,et al.  PIM : planning in manufacturing using skeletal plans and features , 1992 .

[24]  Bernhard Nebel,et al.  Terminological Cycles: Semantics and Computational Properties , 1991, Principles of Semantic Networks.

[25]  Knut Hinkelmann,et al.  Combining Terminological and Rule-based Reasoning for Abstraction Processes , 1992, GWAI.

[26]  R. Acevedo,et al.  Research report , 1967, Revista odontologica de Puerto Rico.

[27]  Volker Weispfenning,et al.  The Complexity of Linear Problems in Fields , 1988, Journal of symbolic computation.

[28]  Bernhard Nebel,et al.  Reasoning and Revision in Hybrid Representation Systems , 1990, Lecture Notes in Computer Science.

[29]  Stefan Bussmann.  Prototypical concept formation : an alternative approach to knowledge representation , 1991 .

[30]  Mathias Bauer,et al.  An Interval-based Temporal Logic in a Multivalued Setting , 1992, CADE.

[31]  Bernhard Hollunder,et al.  Subsumption Algorithms for Concept Description Languages , 1990, ECAI.

[32]  Gert Smolka,et al.  Records for Logic Programming , 1994, J. Log. Program..

[33]  Ansgar Bernardi,et al.  Feature Based Integration of CAD and CAPP , 1992, Rechnerunterstütztes Entwerfen und Konstruieren.

[34]  Emil L. Post.  A variant of a recursively unsolvable problem , 1946 .

[35]  Hans Uszkoreit,et al.  Strategies for Adding Control Information to Declarative Grammars , 1991, ACL.

[36]  Deborah L. McGuinness,et al.  CLASSIC: a structural data model for objects , 1989, SIGMOD '89.

[37]  Jochen Heinsohn.  DFKI Workshop on Taxonomic Reasoning : Proceedings. Saarbrücken, February 26, 1992 , 1992 .

[38]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[39]  Rüdiger Loos,et al.  Applying Linear Quantifier Elimination , 1993, Comput. J..

[40]  Winfried Graf,et al.  Constraint-Based Graphical Layout of Multimodal Presentations , 1998, Advanced Visual Interfaces.

[41]  Franz Baader,et al.  A Scheme for Integrating Concrete Domains into Concept Languages , 1991, IJCAI.

[42]  Harold Boley,et al.  Extended Logic-plus-Functional Programming , 1991, ELP.

[43]  Chidanand Apté,et al.  Organizing Knowledge in a Complex Financial Domain , 1987, IEEE Expert.