The parallel L-machine for symbolic computation

  • Bruno Buchberger
Parallel Symholic And Algebraic Computation
Part of the Lecture Notes in Computer Science book series (LNCS, volume 204)


Parallel Machine Symbolic Computation Parallel Inference Generation Computer System Inference Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. Apetsberger, K., 1985: Substitution Expressions: Extracting Solutions from Non-Horn-Clause Proofs. EUROCAL 85, these proceedings, 78–86.Google Scholar
  2. Buchberger, B., 1978: Computer-Trees and Their Programming. Proc. 4th Coll. "Trees in Algebra and Programming", Univ. Lille, Feb. 16–18, 1978, pp. 1–18.Google Scholar
  3. Buchberger, B., 1983: Components for Restructurable Multi-Micro-Processor Systems of Arbitrary Topology. Proc. of MIMI 83 (Lugano), Acta Press Anaheim, pp. 67–71.Google Scholar
  4. Buchberger, B., 1984: The Present State of the L-Networks Project. Proc. of MIMI 84 (Bari), Acta Press Anaheim, pp. 178–181.Google Scholar
  5. Bibel W., Buchberger B., 1984: Towards a Connection Machine for Logical Inference. (Invited talk, Int. Symp. on Fifth Generation and Super Computers, Rotterdam, December 84). Future Generations Computer Systems, 1/3, 177–188.Google Scholar
  6. Hintenaus, P., Buchberger, B., 1985: The L-Language for the Parallel L-Machine (A Parallel Architecture for AI Applications). Proc. of the ÖGAI Conference, Vienna, September 1985, to appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Bruno Buchberger
    • 1
  1. 1.Johannes Kepler UniversityLinzAustria (Europe)

Personalised recommendations