This paper presents a method for semantic indexing and describes its application in the field of knowledge representation. Starting point of the semantic indexing is the knowledge represented by concept hierarchies. The goal is to assign keys to nodes (concepts) that are hierarchically ordered and syntactically and semantically correct. With the indexing algorithm, keys are computed such that concepts are partially unifiable with all more specific concepts and only semantically correct concepts are allowed to be added. The keys represent terminological relationships. Correctness and completeness of the underlying indexing algorithm are proven. The use of classical relational databases for the storage of instances is described. Because of the uniform representation, inference can be done using case-based reasoning and generic problem solving methods.

翻译：本文提出一种语义索引方法，并描述其在知识表示领域的应用。语义索引的起点是由概念层次结构表示的知识，其目标是为按层次排序的节点（概念）分配语义与句法均正确的键值。通过该索引算法计算的键值应满足：概念与所有更具体概念可部分统一，且仅允许添加语义正确的概念。这些键值表征术语关系。本文证明了底层索引算法的正确性与完备性，并描述了如何利用经典关系数据库存储实例。由于采用统一表示，可通过基于案例的推理与通用问题求解方法实现推理。