Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2019
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/1910.01539 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910788549083136 |
|---|---|
| author | Petersohn, Uwe Zimmer, Sandra Lehmann, Jens |
| author_facet | Petersohn, Uwe Zimmer, Sandra Lehmann, Jens |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1910_01539 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | Method for the semantic indexing of concept hierarchies, uniform representation, use of relational database systems and generic and case-based reasoning Petersohn, Uwe Zimmer, Sandra Lehmann, Jens Artificial Intelligence 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. |
| title | Method for the semantic indexing of concept hierarchies, uniform representation, use of relational database systems and generic and case-based reasoning |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/1910.01539 |