Hierarchical graphs are a frequent solution for capturing symbolic data due the importance of hierarchies for defining knowledge. In these graphs, relations among elements may contain large portions of the element’s semantics. However, knowledge discovery based on analyzing the patterns of hierarchical relations is rarely used. We outline four inference based algorithms exploiting semantic properties of hierarchically represented knowledge for producing new links, and test one of them on a generalization of Cyc’s KB. Finally, we argue why such algorithms can be useful for unsupervised learning and supervised analysis of a KB
CitationGarcia-Gasulla, D.; Cortes, C. Hierarchical inference applied to Cyc. A: Congrés Internacional de l’Associació Catalana d’Intel·ligència Artificial. "Artificial intelligence research and development : proceedings of the 16th International Conference of the Catalan Association for Artificial Intelligence". Vic: IOS PRESS-ECSC, BRUXELLES, 2013, p. 1-4.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com