两个操作的大规模并行实现:统一和继承

Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI:10.1109/PARBSE.1990.77189

C. Constantinescu

{"title":"两个操作的大规模并行实现:统一和继承","authors":"C. Constantinescu","doi":"10.1109/PARBSE.1990.77189","DOIUrl":null,"url":null,"abstract":"The author develops two algorithms for a massively parallel system, and SIMD (single instruction, multiple data) computer with a general and fast communication network. Each of the two operations (unification and inheritance) is basic for one knowledge representation scheme. Both take data represented by directed graphs. For ease of integration in real systems and naturalness of specification, the operations are implemented incrementally, in the spirit of M.R. Quillian's 'spreading activation', and not as atomic operations. The running time of both algorithms is almost linear in the number of vertices on the longest path in the graph representation. The association of the two operations is not accidental; the author intends to integrate them in a hybrid reasoning system.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Massively parallel implementation of two operations: unification and inheritance\",\"authors\":\"C. Constantinescu\",\"doi\":\"10.1109/PARBSE.1990.77189\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The author develops two algorithms for a massively parallel system, and SIMD (single instruction, multiple data) computer with a general and fast communication network. Each of the two operations (unification and inheritance) is basic for one knowledge representation scheme. Both take data represented by directed graphs. For ease of integration in real systems and naturalness of specification, the operations are implemented incrementally, in the spirit of M.R. Quillian's 'spreading activation', and not as atomic operations. The running time of both algorithms is almost linear in the number of vertices on the longest path in the graph representation. The association of the two operations is not accidental; the author intends to integrate them in a hybrid reasoning system.<<ETX>>\",\"PeriodicalId\":389644,\"journal\":{\"name\":\"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PARBSE.1990.77189\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PARBSE.1990.77189","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

作者针对大规模并行系统和具有通用快速通信网络的SIMD(单指令多数据)计算机开发了两种算法。两种操作(统一和继承)中的每一种都是一个知识表示方案的基础。两者都采用有向图表示的数据。为了便于在实际系统中集成和规范的自然性，按照M.R. Quillian的“扩展激活”精神，这些操作是增量实现的，而不是原子操作。两种算法的运行时间在图表示中最长路径上的顶点数量上几乎是线性的。这两种操作的关联并非偶然;作者打算将它们集成到一个混合推理系统中。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Massively parallel implementation of two operations: unification and inheritance

The author develops two algorithms for a massively parallel system, and SIMD (single instruction, multiple data) computer with a general and fast communication network. Each of the two operations (unification and inheritance) is basic for one knowledge representation scheme. Both take data represented by directed graphs. For ease of integration in real systems and naturalness of specification, the operations are implemented incrementally, in the spirit of M.R. Quillian's 'spreading activation', and not as atomic operations. The running time of both algorithms is almost linear in the number of vertices on the longest path in the graph representation. The association of the two operations is not accidental; the author intends to integrate them in a hybrid reasoning system.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications

自引率

0.00%

发文量