Massive Parallelism in Inference Systems

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

[1]  María-Blanca Ibáñez-Espiga.  Parallel Inferencing in First Order Logic Based on the Connection Method , 1988, AIMSA.

[2]  Ehud Shapiro.  Concurrent Prolog: A Progress Report , 1986, Computer.

[3]  Evan Tick,et al.  Parallel logic programming , 1991, Logic programming.

[4]  Wolfgang Bibel.  Matings in matrices , 1983, CACM.

[5]  Keith L. Clark,et al.  PARLOG: parallel programming in logic , 1986, ACM Trans. Program. Lang. Syst..

[6]  John A. Barnden.  Neural-Net Implementation of Complex Symbol-Processing in a Mental Model Approach to Syllogistic Reasoning , 1989, IJCAI.

[7]  Willard L. Miranker,et al.  Beyond massive parallelism: numerical computation using associative tables , 1990, Parallel Comput..

[8]  Geoffrey E. Hinton,et al.  Distributed Representations , 1986, The Philosophy of Artificial Intelligence.

[9]  Harald Westphal.  Eine Beurteilung paralleler Modelle für Prolog , 1986, GI Jahrestagung.

[10]  Giancarlo Succi,et al.  Data Parallelism in Logic Programming , 1991, ICLP Workshop on Parallel Execution of Logic Programs.

[11]  Lokendra Shastri,et al.  Rules and Variables in Neural Nets , 1991, Neural Computation.

[12]  Steffen Hölldobler.  A Structured Connectionist Unification Algorithm , 1990, AAAI.

[13]  Laxmikant V. Kalé,et al.  A Tree Representation for Parallel Problem Solving , 1988, AAAI.

[14]  W. Daniel Hillis,et al.  Data parallel algorithms , 1986, CACM.

[15]  Simon H. Lavington,et al.  Non-WAM Models of Logic Programming and Their Support by Novel Parallel Hardware , 1990, Dagstuhl Seminar on Parallelization in Inference Systems.

[16]  Lokendra Shastri.  A Connectionist Approach to Knowledge Representation and Limited Inference , 1988 .

[17]  Viktor K. Prasanna.  Special Issue on Massively Parallel Computation , 1991, J. Parallel Distributed Comput..

[18]  Simon Kasif,et al.  Some Results on the Complexity of Exploiting Data Dependency in Parallel Logic Programs , 1989, J. Log. Program..

[19]  W. Daniel Hillis,et al.  Connection Machine Lisp: fine-grained parallel symbolic processing , 1986, LFP '86.

[20]  C. L. Giles,et al.  Machine learning using higher order correlation networks , 1986 .

[21]  David L. Waltz,et al.  Applications of the Connection Machine , 1990, Computer.

[22]  Wolfgang Bibel,et al.  On Matrices with Connections , 1981, JACM.

[23]  C. L. Giles,et al.  Second-order recurrent neural networks for grammatical inference , 1991, IJCNN-91-Seattle International Joint Conference on Neural Networks.

[24]  Gadi Pinkas,et al.  Symmetric Neural Networks and Propositional Logic Satisfiability , 1991, Neural Computation.

[25]  Gadi Pinkus.  Constructing Proofs in Symmetric Networks , 1991, NIPS.

[26]  Laxmikant V. Kalé,et al.  The Reduce-Or Process Model for Parallel Execution of Logic Programs , 1991, J. Log. Program..

[27]  David L. Waltz,et al.  Artificial Intelligence Related Research on the Connection Machine , 1988, FGCS.

[28]  L. W. Tucker,et al.  Architecture and applications of the Connection Machine , 1988, Computer.

[29]  David L. Waltz.  Massively Parallel AI , 1993, Int. J. High Speed Comput..

[30]  Emile H. L. Aarts,et al.  Computations in massively parallel networks based on the Boltzmann machine: a review , 1989, Parallel Comput..

[31]  Keith L. Clark,et al.  PARLOG and Its Applications , 1988, IEEE Trans. Software Eng..

[32]  Kenneth M. Kahn,et al.  The Language FCP(: , ?) , 1988, FGCS.

[33]  J. A. Barnden.  Simulations of Conposit, a supra-connectionist architecture for commonsense reasoning , 1988, Proceedings., 2nd Symposium on the Frontiers of Massively Parallel Computation.

[34]  Gordon Bell,et al.  The future of high performance computers in science and engineering , 1989, CACM.

[35]  Akikazu Takeuchi,et al.  An Object-Oriented Programming Language Based on the Parallel Logic Programming Language KL1 , 1987, ICLP.

[36]  Ron Sun,et al.  A connectionist model for commonsense reasoning incorporating rules and similarities , 1992 .

[37]  Péter Szeredi.  Performance Analysis of the Aurora Or-Parallel Prolog System , 1989, NACLP.

[38]  David H. D. Warren,et al.  The SRI Model for Or-Parallel Execution of Prolog: Abstract Design and Implementation Issues , 1987, SLP.

[39]  Lisa Hellerstein,et al.  Implementing Parallel Algorithms in Concurrent Prolog: The MAXFLOW Experience , 1984, SLP.

[40]  L. Shastri,et al.  From simple associations to systematic reasoning: A connectionist representation of rules, variables and dynamic bindings using temporal synchrony , 1993, Behavioral and Brain Sciences.

[41]  Maria Blanca Ibáñez.  Inférence parallèle et processus communicants pour les clauses de Horn : extension au premier ordre par la méthode de connexion , 1990 .

[42]  David L. Waltz,et al.  Toward memory-based reasoning , 1986, CACM.

[43]  Susan I. Hruska,et al.  Hybrid systems: the equivalence of rule-based expert system and artificial neural network inference , 1991 .

[44]  Martin Nilsson,et al.  Massively Parallel Implementation of Flat GHC on the Connection Machine , 1988, Fifth Generation Computer Systems.

[45]  Karen A. Frenkel,et al.  Evaluating two massively parallel machines , 1986, CACM.

[46]  Michael J. Swain,et al.  Parallel Hardware for Constraint Satisfaction , 1988, AAAI.