A brief description of the PROTOS-L system

  • Christoph Beierle
  • Gregor Meyer
  • Heiner Semle
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 567)


The PROTOS-L system is an outcome of a research effort within the EUREKA Project PROTOS (Logic Programming Tools for Building Expert Systems, EU 56) aimed at overcoming some of the shortcomings of Prolog. It consists of a logic programming language including various advanced features together with a state-of-the-art implementation approach based on an abstract machine.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    C. Beierle. An overview on planning applications in PROTOS-L. In Proceedings 13th IMACS World Congress on Computation and Applied Mathematics, Dublin, Ireland, July 1991. (to appear).Google Scholar
  2. [2]
    C. Beierle. Types, modules and databases in the logic programming language PROTOS-L. In K. H. Bläsius, U. Hedtstück, and C.-R. Rollinger, editors, Sorts and Types for Artificial Intelligence, Springer-Verlag, Berlin, Heidelberg, New York, 1990.Google Scholar
  3. [3]
    C. Beierle, S. Böttcher, and G. Meyer. Draft Report of the Logic Programming Language PROTOS-L. IWBS Report, IBM Germany, Scientific Center, Inst. for Knowledge Based Systems, Stuttgart, 1991.Google Scholar
  4. [4]
    C. Beierle, G. Meyer, and H. Semle. Extending the Warren Abstract Machine to polymorphic ordersorted resolution. In V. Saraswat and K. Uedo, editors, Logic Programming: Proceedings of the 1991 International Symposium, MIT Press, San Diego, October 1991. (to appear).Google Scholar
  5. [5]
    H. Jasper. A logic-based programming environment for interactive applications. In Proc. Human Computer Interaction International, Stuttgart, 1991. (to appear).Google Scholar
  6. [6]
    G. Meyer. Rule Evaluation on Databases in the PROTOS-L System. Diplomarbeit Nr. 630, Universität Stuttgart und IBM Deutschland GmbH, Stuttgart, December 1989. (in German).Google Scholar
  7. [7]
    W. Nutt and G. Smolka. Implementing TEL. SEKI-Report, FB Informatik, Universität Kaiserslautern, 1991. (in preparation).Google Scholar
  8. [8]
    H. Semle. Extension of an Abstract Machine for Order-Sorted Prolog to Polymorphism. Diplomarbeit Nr. 583, Universität Stuttgart und IBM Deutschland GmbH, Stuttgart, April 1989. (in German).Google Scholar
  9. [9]
    G. Smolka. TEL (Version 0.9), Report and User Manual. SEKI-Report SR 87-17, FB Informatik, Universität Kaiserslautern, 1988.Google Scholar
  10. [10]
    D. Warren. An Abstract PROLOG Instruction Set. Technical Report 309, SRI, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Christoph Beierle
    • 1
  • Gregor Meyer
    • 1
  • Heiner Semle
    • 1
  1. 1.IBM GermanyScientific Center Institute for Knowledge Based SystemsStuttgart 80Germany

Personalised recommendations