Improving the execution speed of compiled Prolog with modes, clause selection, and determinism

  • Peter Van Roy
  • Bart Demoen
  • Yves D. Willems
Session CFLP 2 Language Features And Compilation In Logic Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 250)


Test Block Total Execution Time Choice Point Execution Speed Prolog Program 
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.

7. References

  1. Bruynooghe M., Is logic programming real programming, in Proc. AIMSA86, eds. Ph. Jourrand, V. Sgurev, Varna, sept. 1986, North Holland, in printGoogle Scholar
  2. Bruynooghe M., Weemeeuw P., Towards more efficiency of Prolog on conventional hardware, Report CW 45, Dept. of Computer Science, K.U.Leuven.Google Scholar
  3. Bruynooghe M., Demoen B., Callebaut A. and Janssens G., Abstract interpretation at work, Draft report, Dept. of Computer Science, K.U.Leuven.Google Scholar
  4. Debray S.K., Warren D.S., Detection and optimization of functional computations in Prolog, Proc. 3th Int. Conf. on Logic Programming., London, july 1986, 490–504.Google Scholar
  5. Debray S.K., Warren D.S., Automatic mode inference for Prolog programs, Proc. 1986 Symposium on Logic Programming, Salt Lake City, sept 1986, 78–88.Google Scholar
  6. Demoen, B., BIM-Prolog Manual, BIM, Kwikstraat 4, B-3078 Everberg Belgium, 1986.Google Scholar
  7. Dobry, T. et al, Performance Studies of a Prolog Machine Architecture, Proc. 12th Int. Symp. Comp. Arch., June 1985.Google Scholar
  8. Mellish, C.S., The Automatic Generation of Mode Declarations for Prolog Programs, Research Report 163, Dept. of Artificial Intelligence, Univ. of Edinburgh, 1981.Google Scholar
  9. Mellish, C.S., Some Global Optimizations for a Prolog compiler, J. Logic Programming, pp. 43–66, Vol. 1, 1985.Google Scholar
  10. Sawamura H., Takeshima T., Recursive unsolvability of determinacy, solvable cases of determinacy and their applications to Prolog optimization, Proc. 1985 Symposium on Logic Programming, Boston, july 1985, 200–207.Google Scholar
  11. Van Roy, P., A Prolog Compiler for the PLM, Report No. UCB/CSD 84/203, Univ. of California, Berkeley, Nov. 1984.Google Scholar
  12. Van Roy, P., Demoen, B., Improving the execution speed of compiled Prolog with modes, clause selection, and determinism. CW Report No. 51, K.U.Leuven, Dept. of Comp. Sc., nov. 1986.Google Scholar
  13. Warren, D.H.D., Applied Logic — Its use and implementation as a programming tool, Ph.D. Thesis, Univ. of Edinburgh, 1977. Reprinted as Technical Note 290, SRI International, 1983.Google Scholar
  14. Warren, D.H.D., An Efficient Easily Adaptable System for Interpreting Natural Language Queries, American Journal of Computational Linguistics, pp. 110–122, Vol. 8, 1982.Google Scholar
  15. Warren, D.H.D., An Abstract Prolog Instruction Set, AI Center, SRI International, Menlo Park CA 94025, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Peter Van Roy
    • 1
  • Bart Demoen
    • 2
  • Yves D. Willems
    • 1
  1. 1.Department ComputerwetenschappenKatholieke Universiteit LeuvenHeverleeBelgium
  2. 2.Computer Science Division, Department of EECSUniversity of California at BerkeleyBerkeley

Personalised recommendations