Massive Parallelism in Inference Systems

作者: Franz Kurfeß , None

DOI: 10.1016/B978-0-444-81704-4.50016-8

关键词:

摘要: This contribution concentrates on two aspects of massive parallelism and inference: first, the potential in logic is investigated, then an massively parallel inference system based connectionist techniques presented. 1

参考文章(54)
Péter Szeredi, Performance Analysis of the Aurora Or-Parallel Prolog System. NACLP. pp. 713- 732 ,(1989)
Hidehiko Tanaka, Martin Nilsson, Massively Parallel Implementation of Flat GHC on the Connection Machine. Future Generation Computer Systems. pp. 1031- 1040 ,(1988)
Lisa Hellerstein, Ehud Y. Shapiro, Implementing Parallel Algorithms in Concurrent Prolog: The MAXFLOW Experience. SLP. pp. 99- 115 ,(1984)
David L. Waltz, Craig Stanfill, Artificial Intelligence Related Research on the Connection Machine. Future Generation Computer Systems. pp. 1010- 1024 ,(1988)
María-Blanca Ibáñez-Espiga, Parallel Inferencing in First Order Logic Based on the Connection Method. artificial intelligence: methodology, systems, applications. pp. 149- 157 ,(1988)
Shmuel Kliger, Kenneth M. Kahn, Ehud Y. Shapiro, Eyal Yardeni, The Language FCP( Future Generation Computer Systems. pp. 763- 773 ,(1988)
Akikazu Takeuchi, Koichi Furukawa, Masaru Ohki, An Object-Oriented Programming Language Based on the Parallel Logic Programming Language KL1. international conference on lightning protection. pp. 894- 909 ,(1987)
L. V. Kale, A tree representation for parallel problem solving national conference on artificial intelligence. pp. 677- 680 ,(1988)