|
Abenson H and Sussman GJ, 1984. Structure and Interpretation of Computer Programs, Massachusetts: The MIT Press
Google Scholar
|
|
Church A, 1941. The Calculi of Lambda-Conversion, New Jersey: Princeton University Press
Google Scholar
|
|
Clarke TIW, 1980. “SKIM—The S, K, I Reduction Machine”, Proc. 1980 LISP Conf.Stanford
Google Scholar
|
|
Darlington J and Reeve M, 1983. “ALICE and the Parallel Evaluation of Logic Programs”, 10th Int. Symp. on Computer Architecture
Google Scholar
|
|
Keller RM, 1978. “A loosely coupled applicative multiprocessing system”, Proc. Nat. Computer Conf.,AFIPS Press, pp 861–870
Google Scholar
|
|
Keller RM, 1984. “REDIFLOW Multiprocessing”, Proc. IEEE COMPCON Spring 84, pp 410–414
Google Scholar
|
|
Kluge WE, 1979. “The architecture of a reduction language machine hardware model”, Tech. Rep. ISF-Rep. 79.03, Gesellschaft fur Mathematik und Datenverarbeitung MBH Bonn.
Google Scholar
|
|
Kluge W and Schmittgen C, 1987. “Reduction Languages and Reduction Systems”, In: Future Parallel Computers, Lecture Note in Computer Science, vol. 272, Treleaven, P and Vanneschi, M, eds, pp 153–182
Google Scholar
|
|
Moon D, 1985. “Architecture of the Symbolics 3600”, Proc. Twelth. Int. Symp. on Computer Architecture, pp 76–83
Google Scholar
|
|
Peyton-Jones S, 1985. “GRIP—a Parallel Graph Reduction Machine”, University College London, Dept. of Computer Science, Technical Report 1665
Google Scholar
|
|
Richards H, 1985. “An Overview of the Burroughs NORMA”, Internal Report Burroughs Corp, Austin Research Centre
Google Scholar
|
|
Rieger C, 1981. “ZMOB: A new computing engine for AI”, Proc. 7th IJCAI-81, Vancouver, pp 955–960
Google Scholar
|
|
Bibel W and Buchberger B, 1983. “Towards a Connection Machine for Logical Inference”, Proc. Int. Sym. on Fifth Generation and Super Computers, Rotterdam, December 11–13, 1984, Future Generations Computer Systems1 (3) pp 177–188
Google Scholar
|
|
Clocksin W and Mellish C, 1981. Programming in PROLOG, New York: Springer-Verlag.
Google Scholar
|
|
van Emden MH and Kowalski RA, 1976. “The Semantics of Predicate Calculus as a Programming Language”, JACM23 (4) pp 733–742
Google Scholar
|
|
Gonzales-Rubio R and Rohmer J, 1985. “From databases to Artificial Intelligence: A Hardware Point of view”, Les Arcs, France: AIS, NATO
Google Scholar
|
|
Kowalski R, 1979. Logic for Problem Solving, Amsterdam: North-Holland
Google Scholar
|
|
Moto-oka T., 1984. “The Architecture of a Parallel Engine PIE”, Proc. Int. Con. on Fifth Generation Computer Systems, Tokyo, pp 479–488
Google Scholar
|
|
Onai R, 1984. “An Approach to a Parallel Inference Machine Based on Control-Driven and Data-Driven Mechanisms”, Tech. Rep. TR-042, ICOT
Google Scholar
|
|
Sohma Y, 1985. “A New Parallel Inference Mechanism Based on Sequential Processing”, Proc. IFIP TC-10 Work. Conf. on Fifth Gen. Comp. Arch,UMIST Manchester
Google Scholar
|
|
Tick E and Warren DHD, 1984. “Towards a Pipelined Prolog-Processor”, Proc. 1984 Int. Sym. on Logic Programming
Google Scholar
|
|
Uchida S, 1983. “Outline of a Personal Sequential Inference Machine: PSI”, New Generation Computing1 (1)
Google Scholar
|
|
Warren DHD, 1977. “IMPLEMENTING PROLOG—compiling predicate logic programs”, Dept. of Artificial Intelligence, Univ. of Edinburgh, Research Report No. 39
Google Scholar
|
|
BBN, 1985. “BUTTERFLY Parallel Processor Overview”, Tech. Rep. Bolt Beranek and Newman Labs. Inc., Cambridge, MA
Google Scholar
|
|
Brownston L, 1985. Programming Expert Systems in OPS5, New York: Addison-Wesley
Google Scholar
|
|
Davis AL and Robison SV, 1985. “The Architecture of the FAIM-1 Symbolic Multiprocessing System”, Proc. Int. Joint Conf. on Artificial Intelligence, pp 32–38
Google Scholar
|
|
Forgy CL, 1981. “The OPS5 user's Manual”, Tech. Report CMU-CS-81–135, Computer Science Department, Carnegie-Mellon University
Google Scholar
|
|
Forgy CL, 1982. “Rete: A Fast Algorithm for the Many Pattern/Many Object Match Problem”, Artificial Intelligence19 pp. 17–37
Google Scholar
|
|
Forgy C, 1984. “Initial Assessment of Architectures for Production Systems”, Proc. Nat. Conf. for Artificial Intelligence AAAI '84, pp 116–120
Google Scholar
|
|
Hayes-Roth F, 1983. Building Expert Systems, New York: Addison-Wesley
Google Scholar
|
|
Hillyer BK and Shaw DE, 1983. “Rapid Execution of AI Production Systems on the NON-VON Supercomputer”, Tech. Rep., Dept. of Comp. Sc., Columbia Univ., New York
Google Scholar
|
|
Stolfo SJ and Shaw DE, 1982. “DADO: A Tree-Structured Machine Architecture for Production Systems”, Proc. Nat. Conf. on AI AAAI-82, pp 242–246
Google Scholar
|
|
Fahlman S, 1980. “Design sketch for a million-element NETL machine”, Proc. AAAI–80, Stanford, pp 249–251
Google Scholar
|
|
Fahlman SE, 1983. “Massively Parallel Architectures for AI: NETL, Thistle and Boltzmann Machines”, Proc. Nat. Conf. of AI, AAAI-83, pp 109–113
Google Scholar
|
|
Feldman JA, 1985. “CONNECTIONS”, Byte10 (4) pp 277–284
Google Scholar
|
|
Hillis WD, 1984. “The Connection Machine: A computer architecture based on cellular automata”, Cellular Automata, Farmer, et al., ed, pp 213–229
Google Scholar
|
|
Ohbuchi R, 1985. “Overview of Parallel Processing Research in Japan”, IBM Japan Science Institute, JSI Research Report TR87–0003
Google Scholar
|
|
Treleaven PC, 1982. “Data Driven and Demand Driven Computer Architecture”, ACM Computing Surveys14 (1) pp 93–143
Google Scholar
|
|
Barren I, 1983. “Transputer does 5 or more MIPS even when not used in parallel”, Electronics56 (23) pp 109–115
Google Scholar
|
|
May D, Shepard R and Keane C, 1987. “Communicating sequential processes: Transputer and Occam”, In: Treleaven PC and Vaneschi M, eds, Future Parallel Computers, New York: Springier Verlag
Google Scholar
|
