Skip to main content

Logische Programmiersprachen

  • Chapter
  • 26 Accesses

Zusammenfassung

Die logischen Programmiersprachen sind noch ein relativ neues Gebiet der Informatik, obwohl sie auf Vorgänger in der Mathematik, die formale Logik, zurückgreifen können. In diesem Einführungsabschnitt soll zur Motivation noch einmal die Entstehungsgeschichte von Prolog aus der formalen Logik nachvollzogen werden. Trotz der umfangreichen Darstellung in den nächsten Abschnitten kann keine erschöpfende Beschreibung von Prolog erwartet werden, das würde den Rahmen dieses Buches sprengen. Auf weiterführende Literatur wird später verwiesen.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literaturverzeichnis

  1. Ali, K. A. M.: OR-parallel execution of Prolog on a multi-sequential machine, in: Int. Journal of Parallel Programming 15 (1987), Nr. 3

    Google Scholar 

  2. Appelrath, H.-J.; Bense, H.: Zwei Schritte zur Verbesserung von PROLOG-Programmiersystemen: DB-Unterstützung und Meta-Interpreter, IFB 94, DatenbankSysteme für Büro, Technik und Wissenschaft, Berlin, Heidelberg, New York, Tokyo: Springer 1985, 161–176

    Google Scholar 

  3. Bachinger, J.: Implementierung eines parallelen Theorembeweisers und Simulation der Ausführung auf einer Multiprozessormaschine, Diplomarbeit, Institut für Informatik, TU München, 1987

    Google Scholar 

  4. Bauer, F. L.; Wössner, H.: Algorithmische Sprache und Programmentwicklung, Berlin, Heidelberg, New York, Tokyo: Springer 1981

    MATH  Google Scholar 

  5. Bayer, R.: Database Technology for Expert Systems, IFB 112, Berlin, Heidelberg, New York, Tokyo: Springer 1985, 1–16

    Google Scholar 

  6. Benker, H.; Jeffré, T.; Noyé, J.; Pöhlmann, A.; et al.: ICM3: Final Specification, Report on a High Speed Inference Co-processor, Part One: Chapters 1 to 8, Technical Report CA-23, ECRC, München, 1987

    Google Scholar 

  7. Bic, L.; Lee, C.: A Resource-Limited Process Model for PEPSy, Technical Report CA-21, ECRC, München, 1986

    Google Scholar 

  8. Böhme, G.: Einstieg in die Mathematische Logik, München, Wien: Hanser 1981

    MATH  Google Scholar 

  9. Chassin de Kergommeaux, J.; Robert, P.; Westphal, H.: An Abstract Machine for the Implementation of the PEPSys Model, Technical Report CA-26, ECRC, München, 1987

    Google Scholar 

  10. Chikayama, T.; Kimura Y.: Multiple Reference Management in Flat GHC, in.: Proc. 4th Intern. Conf. on Logic Programming, 1987, Cambridge Mass., MIT Press, 276–293

    Google Scholar 

  11. Ciepielewski, A.; Haridi, S.: Control of Activities in the OR-Parallel Token Machine, in: Proc.1984 IEEE Logic Programming Conf., 1984, 49–57

    Google Scholar 

  12. Ciepielewsi, A.; Hausman, B.; Haridi, S.: Initial Evaluation of a Virtual Machine for OR-Parallel Execution of Logic Programs, in: Proc. IFIP TC-10 Working Conf. on Fifth Generation Computer Architecture, 1985, 81–99

    Google Scholar 

  13. Clark, K. L.; Gregory, S.: A Relational Language for Parallel Programming, in: Proc. 1981 Conf. on Functional Progr. Languages and Comp. Architecture, ACM, 171–178

    Google Scholar 

  14. Clark, K. L.; Gregory, S.: PARLOG: Parallel Programming in Logic, ACM Transactions on Programming Languages and Systems, 8 (1986), 1–49

    Article  MATH  Google Scholar 

  15. Clark, K. L.; Gregory, S.: PARLOG and Prolog United, in: Proc. 4th Intern. Conf. on Logic Programming, 1987, MIT Press, 927–961

    Google Scholar 

  16. Clocksin, W. F.; Mellish, C. S.: Programming in Prolog, Berlin, Heidelberg, New York, Tokyo: Springer 1984

    Google Scholar 

  17. Codish, M.; Shapiro, E.: Compiling OR-parallelism into AND-parallelism, in: Proc. 3rd Int. Conf. on Logic Programming, LNCS 225, Berlin, Heidelberg, New York, Tokyo: Springer 1986, 283–297

    Google Scholar 

  18. Crammond, J. A.: An Execution Model for Committed-Choice Nondeterministic Languages, in: Proc. of the Symposium on Logic Programming, 1986, 148–158

    Google Scholar 

  19. Darlington, J.; Reeve, M.J.: ALICE: a multi-process reduction machine, in: Proc. of the ACM Conf. on Functional Progr. Languages and Comp. Architecture, 1981, 171–178

    Google Scholar 

  20. DeGroot, D.: Restricted AND-Parallelism, in: Proc. International Conf. on Fifth Generation Computer Systems, 1984, 471–478

    Google Scholar 

  21. Dijkstra, E. W.: A Discipline of Programming, Englewood Cliffs, N.J.: Prentice-Hall 1976

    MATH  Google Scholar 

  22. Estenfeld, K.; Meier, M.: ECRC-Prolog User’s Manual, Version 1.2, Technical Report LP-8, ECRC, München, 1986

    Google Scholar 

  23. Fagin, B.; Dobry, T.: The Berkeley PLM Instruction Set: An Instruction Set for Prolog, Report No. UCB/CSD 86/257, Berkeley, 1985

    Google Scholar 

  24. Foster, I.: Logic Operating Systems: Design Issues, in: Proc. 4th Intern. Conf. on Logic Programming, 1987, Cambridge Mass., MIT Press, 910–926

    Google Scholar 

  25. Fuchi, K.; Furukawa, K.: The Role of Logic Programming in the Fifth Generation Computer Project, in: 3rd Int. Conf. on Logic Programming, LNCS 225, Berlin, Heidelberg, New York, Tokyo: Springer 1986, 1–24

    Google Scholar 

  26. Furukawa, K.: The Conceptual Specification of the Kernel Language Version 1, Techn. Report TR-054, ICOT, 1984

    Google Scholar 

  27. Giloi, W. K.: Rechnerarchitektur, Berlin, Heidelberg, New York, Tokyo: Springer 1981

    MATH  Google Scholar 

  28. Gregory S.: Parallel Logic Programming in PARLOG, Reading, Mass.: Addison-Wesley 1987

    Google Scholar 

  29. Hailperin, M.; Westphal, H.: An Empirical Study of Locality of Reference in Prolog, Technical Report CA-15, ECRC, München, 1986

    Google Scholar 

  30. Hailperin, M.; Westphal, H.: A Computational Model for PEPSy, Technical Report CA-16, ECRC, München, 1986

    Google Scholar 

  31. Haridi, S.; Ciepielewski, A.: An OR-Parallel Token Machine, TRITA-CS-8303, Royal Institute of Technology, Stockholm, 1983

    Google Scholar 

  32. Hausman, B.; Ciepielewski, A.; Haridi, S.: OR-parallel Prolog made effizient on shared memory multiprocessors, in: Proc. 1987 Symp. on Logic Programming, 1987, 69–79

    Google Scholar 

  33. Hoare, C. A. R.: Communicating Sequential Processes, CACM 21 (1978), 666–677

    MATH  Google Scholar 

  34. Houri, A.; Shapiro, E.: A Sequential Abstract Machine for Flat Concurrent Prolog, Rep. CS86-20, Weizmann Inst., Revohot, Israel, 1986

    Google Scholar 

  35. Huntbach, M. M.: Algorithmic Parlog Debugging, in: Proc. 1987 Symp. on Logic Programming, 1987, 288–297

    Google Scholar 

  36. Ichiyoshi, N.; Miyazaki, T.; Taki K.: A Distributed Implementation of Flat GHC on the Multi-PSI, in: Proc. 4th Intern. Conf. on Logic Programming, 1987, The MIT Press, Cambridge Mass., 257–275

    Google Scholar 

  37. Ito, N.; Sato, M.; et al.: The Architecture and Preliminary Evaluation Results of the Experimental Parallel Inference Machine PIM-D, in: Proc. 13th Annual Intern. Symp. on Comp. Architecture, 1986, 149–156

    Google Scholar 

  38. Kahn, K.; Tribble, E. D.; et al.: Objects in Concurrent Logic Programming Languages, in: Proc. OOPSLA’86, 1986, 242–257

    Google Scholar 

  39. Kimura, Y.; Chikayama, T.: An Abstract KL1 Machine and its Instruction Set, in: Proc. 1987 Symp. on Logic Programming, 1987, 468–477

    Google Scholar 

  40. Klein, A.; Eckardt, H.; Istavrinos, P.: Parallelrechner-Architekturen. Eine Studie zum Stand der Technik, Siemens Bericht ZT ZTI SYS 1-52 Kl/Eck/I/Wi, Siemens AG, München, 1987

    Google Scholar 

  41. Kumon, K.; Masuzawa, H.; Itashiki, A.; et al.: Kabu-Wake: A New Parallel Inference Method and its Evaluation, in: Proc. COMPCON ’86, Spring, San Francisco, 1986, 168–172

    Google Scholar 

  42. Lam, M.; Gregory, S.: Parlog and Alice: a Marriage of Convenience, in: Proc. 4th Intern. Conf. on Logic Programming, 1987, Cambridge Mass., MIT Press, 294–310

    Google Scholar 

  43. Levy J.: A Unification Algorithm for Concurrent Prolog, in: Proc. 2nd Int. Logic Programming Conf., 1984, 333–341

    Google Scholar 

  44. Levy J.: Shared Memory Execution of Committed-Choice Languages, in: Proc. 3rd Int. Conf. on Logic Programming, LNCS 225, Berlin, Heidelberg, New York, Tokyo: Springer 1986, 298–312

    Google Scholar 

  45. Levy J.: A GHC Abstract Machine and Instruction Set, in: 3rd Int. Conf. on Logic Programming, LNCS 225, Berlin, Heidelberg, New York, Tokyo: Springer 1986, 157–171

    Google Scholar 

  46. Linnemann, V.: Constructorset’s Database Support for Knowledge Based Systems, in: Proc. Int. Conf. on Data Engineering, 1986, 244–251.

    Google Scholar 

  47. Masuzawa, H.; Kumon, K.; Itashiki, A.; et al.: ”Kabu-Wake” Parallel Inference Mechanism and its Evaluation, in: Proc. 1986 Fall Joint Computer Conf., 1986, 955–962

    Google Scholar 

  48. Matsuda, H.; Kokata, M.; Masuo, T.; et al: Parallel Prolog Machine PARK: Its Hardware Structure and Prolog System, in: Proc. 4th Conf. on Logic Programming, 1985

    Google Scholar 

  49. Missikoff, M.; Wiederhold, G.: Towards a Unified Approach for Expert and Database Systems, in: Proc. First International Workshop on Expert Database Systems, 1986, 383–399.

    Google Scholar 

  50. Miyazaki, T.; Takeuchi, A.; et al.: A Sequential Implementation of Concurrent Prolog Based on the Shallow Binding Scheme, in: Proc. Symp. on Logic Programming, 1985, 110–118

    Google Scholar 

  51. Nakashima, H.; Nakajima, K.: Hardware Architecture of the Sequential Inference Machine: PSI-II, in: Proc. 1987 Symp. on Logic Programming, 1987, 104–113

    Google Scholar 

  52. Ohki, M.; Takeuchi, A.; et al.: An Object-oriented Programming Language Based on the Parallel Logic Programming Language KL1, in: Proc. 4th Intern. Conf. on Logic Programming, 1987, Cambridge Mass., MIT Press, 894–909

    Google Scholar 

  53. Onai, E.; Aso, M.; et al.: Architecture of a Reduction Based Parallel Inference Machine: PIM-R, New Generation Computing 3 (1985), 197–228

    Article  Google Scholar 

  54. Onai, R.; Shimizu, H.; Masuda, K.; Moritoshi, A.: Analysis of Sequential Prolog Programs, in: The Journal of Logic Programming, 1986, 119–141

    Google Scholar 

  55. Parker, D. S.; Carey, M.; Golshani, F.; et al.: Logic Programming and Databases, in: Proc. First International Workshop on Expert Database Systems, 1986, 35–48

    Google Scholar 

  56. Ponder, C. G.; Patt, Y.N.: Alternative Proposals for Implementing Prolog Concurrently and Implications Regarding their Respective Microarchitectures, in: Proc. 17th Annual Microprogramming Workshop, 1984, 192–202

    Google Scholar 

  57. Ratcliffe, M.; Robert, P.: The Static Analysis of Prolog Programs, Technical Report CA-11, ECRC, München, 1985

    Google Scholar 

  58. Ratcliffe, M.: A Case Study of some PEPSy Programs, Internal Report, ECRC, München, 1986

    Google Scholar 

  59. Ratcliffe, M.; Robert, P.: PEPSy: A Prolog for Parallel Processing, Technical Report CA-17, ECRC, München, 1986

    Google Scholar 

  60. Ratcliffe, M.; Syre, J. C.: The PEPSys Parallel Logic Programming Language, in: Proc. 10th IJCAI, 1987

    Google Scholar 

  61. Reuter, A.: Kopplung von Datenbank- und Expertensystemen, Informationstechnik it, 29/3 (1987), 164–175

    Google Scholar 

  62. Robinson, I.: A Prolog Processor based on a Pattern Matching Memory Device, in: Proc. 3rd Int. Conf. on Logic Programming, LNCS 225, Berlin, Heidelberg, New York, Tokyo: Springer 1986, 172–179

    Google Scholar 

  63. Saraswat, V. A.: Problems with Concurrent Prolog, CMU-CS-86-100, Carnegie-Mellon University, 1986

    Google Scholar 

  64. Saraswat, V. A.: GHC: Operational semantics, problems and relationship with CP(|,|), in: Proc. 1987 Symp. on Logic Programming, 1987, 347–358

    Google Scholar 

  65. Sato, M.; Shimizu, H.; et al.: KL1 Execution Model for PIM Cluster with Shared Memory, in: Proc. 4th Intern. Conf. on Logic Programming, 1987, Cambridge Mass., MIT Press, 338–355

    Google Scholar 

  66. Shapiro, E.; Takeuchi, A.: Object Oriented Programming in Concurrent Prolog, New Generation Computing 1 (1983), 25-48

    Article  Google Scholar 

  67. Shapiro, E.: Concurrent Prolog: A Progress Report, Computer, Nr. 8, 1986, 44–58

    Google Scholar 

  68. Shen, K.; Warren, D. H. D.: A simulation study of the Argonne model for OR-parallel execution of Prolog, in: Proc. 1987 Symp. on Logic Programming 1987 54–68

    Google Scholar 

  69. Silverman, W.; Hirsch, M.; et al.: The Logix System User Manual, Weizmann Institute of Science, Techn. Rep. CS-21, Revohot, Israel, 1986

    Google Scholar 

  70. Smith, J. M.: Expert Database Systems: A Database Perspective, in: Proc. First International Workshop on Expert Database Systems, 1986, 3–15

    Google Scholar 

  71. Sohma, Y.; Satoh, K.; Kumon, K.; et al.: A New Parallel Inference Mechanism based on Sequential Processing, in: Proc. IFIP TC-10 Working Conf. on Fifth Generation Computer Architecture, 1985, 3–14

    Google Scholar 

  72. Somogyi, Z.: A system of precise modes for logic programs, in: Proc. 4th Intern. Conf. on Logic Programming, 1987, MIT Press, 769–787

    Google Scholar 

  73. Takeuchi, A.; Furukawa, K.: Bounded Buffer Communication in Concurrent Prolog, New Generation Computing 3 (1985), 145–155

    Article  Google Scholar 

  74. Takeuchi, A.; Furukawa, K.: Interprocess Communication in Concurrent Prolog, ICOT Techn. Rep. TR-006, Tokyo, 1985

    Google Scholar 

  75. Takeuchi, A.; Furukawa, K.: Parallel Logic Programming Languages, in: Proc. 3rd Int. Conf. on Logic Programming, LNCS 225, Berlin, Heidelberg, New York, Tokyo: Springer 1986, 242–254

    Google Scholar 

  76. Taki, K.; Nakajima, K.; et al.: Performance and Architectural Evaluation of the PSI Machine, in: Proc. 2nd Intern. Conf. on Architectural Support for Programming Languages and Operating Systems, Palo Alto, 1987, ACM, 128–135

    Google Scholar 

  77. Tamura, N.; Wada, K.; Matsuda, H.; et al.: Sequential Prolog Machine PEK, in: Proc. Int. Conf. on Fifth Generation Comuter Systems, 1984

    Google Scholar 

  78. Tamaki, H.: Stream-based Compilation of Ground I/O Prolog into Committed-choice Languages, in: Proc. 4th Intern. Conf. on Logic Programming, 1987, Cambridge Mass., The MIT Press, 376–393

    Google Scholar 

  79. Tick, E.; Warren, D. H. D.: Towards a Pipelined Prolog Processor, in: Proc. 1984 Int. Symposium on Logic Programming, 1984, 29–40

    Google Scholar 

  80. Tick, E.: Sequential Prolog Machine: Image and Host Architectures, in: Proc. 17th Annual Microprogramming Workshop MICRO 17, 1984, 204–216

    Google Scholar 

  81. Tribble E. D.; Miller, M. S.; et al.: Channels: A Generalization of Streams, in: Proc. 4th Intern. Conf. on Logic Programming, 1987, Cambridge Mass., The MIT Press 839–857

    Google Scholar 

  82. Tung, Y. -W.: Parallel Processing Model for Logic Programming, Diss. University of Southern California, Los Angeles, 1986

    Google Scholar 

  83. Umeyama, S.; Tamura, K.: A Parallel Execution Model of Logic Programs, in: Proc. 10th Annual Int. Conf. on Computer Architecture, 1983, 349–355

    Google Scholar 

  84. Ueda, K.: Concurrent Prolog Re-Examined, ICOT Techn. Rep. TR-102, Tokyo, 1985

    Google Scholar 

  85. Ueda, K.: Guarded Horn Clauses, ICOT Techn. Rep. TR-103, Tokyo, 1985

    Google Scholar 

  86. Ueda, K.: Making Exhaustive Search Programs Deterministic, in: Proc. 3rd Int. Conf. on Logic Programming, LNCS 225, Berlin, Heidelberg, New York, Tokyo: Springer 1986, 270–282

    Google Scholar 

  87. Ueda, K.: Making Exhaustive Search Programs Deterministic, Part II, in: Proc. 4th Intern. Conf. on Logic Programming, 1987, Cambridge Mass., The MIT Press, 356–375

    Google Scholar 

  88. Warren, D. H. D.: An Abstract Prolog Instruction Set, Technical Note 309, SRI International, Menlo Park, 1983

    Google Scholar 

  89. Warren, D. H. D.: The SRI model for OR-parallel execution of Prolog - abstract design and implementation issues, in: Proc. 1987 Symposium on Logic Programming, 1987, 92–102

    Google Scholar 

  90. Watzlawik, G.; Benker, H.; Noyé, J.: ICM4, Technical Report CA-25, ECRC, München, 1987

    Google Scholar 

  91. Westphal, H.; Hailperin, M.: A Flexible Computational Model for Prolog, Technical Report CA-14, ECRC, München, 1985

    Google Scholar 

  92. Westphal, H.; Robert, P.; Chassin, J.; Syre, J. C.: The PEPSys model: Combining Backtracking, AND- and OR-parallelism, in: Proc. 1987 Symposium on Logic Programming, 1987, 436–448

    Google Scholar 

  93. Woo, N. S.: A Hardware Unification Unit: Design and Analysis, in: Proc. 12th Annual International Symp. on Computer Architecture, 1985, 198–205

    Google Scholar 

  94. Zaniolo, C.: Prolog: A Database Query Language for All Seasons, in: Proc. First International Workshop on Expert Database Systems, 1986, 219–232

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin, Heidelberg

About this chapter

Cite this chapter

Kober, R. (1988). Logische Programmiersprachen. In: Kober, R. (eds) Parallelrechner-Architekturen. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-73896-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-73896-8_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50038-4

  • Online ISBN: 978-3-642-73896-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics