Advertisement

And-or queuing in Extended Concurrent Prolog

  • Jiro Tanaka
  • Takashi Yokomori
  • Makoto Kishishita
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 221)

Abstract

We have modified Concurrent Prolog (CP) Interpreter (Shapiro 1983) and implemented Extended Concurrent Prolog (ECP) Interpreter (Fujitsu 1985), which has OR-parallel, set-abstraction and meta-inference facilities. In Shapiro's CP interpreter only the AND-related goals are enqueued to the scheduling queue. None of OR-related clauses is dealt with. However, our ECP interpreter has only one scheduling queue to which all the AND-related goals and all the OR-related clauses are enqueued. This scheduling method is designated “AND-OR queuing.” AND-OR queuing makes it possible to handle all kinds of AND-relations and OR-relations in a uniform manner.

Keywords

Sequential Implementation System Predicate Stream Form Candidate Clause Guard Horn Clause 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Clark K, Gregory S (1984) Notes on Systems Programming in Parlog. Proceedings of the International Conference on Fifth Generation Computer Systems 299–306Google Scholar
  2. Fujitsu (1984) The Verifying Software of Kernel Language Version 1 — Detailed Specification-, PART II. In: The 1983 Report on Committed Development on Computer Basic Technology, in JapaneseGoogle Scholar
  3. Fujitsu (1985) The Verifying Software of Kernel Language Version 1 — the Revised Detailed Specification and the Evaluation Result-, PART I. In: The 1984 Report on Committed Development on Computer Basic Technology, in JapaneseGoogle Scholar
  4. Furukawa K et al. (1984) The Conceptual Specification of the Kernel Language Version 1. Technical Report TR-054. ICOTGoogle Scholar
  5. Hirakawa H et al. (1984) Eager and Lazy Enumeration in Concurrent Prolog. Proceedings of the Second International Logic Programming Conference 89–100Google Scholar
  6. Levy J (1984) A Unification Algorithm for Concurrent Prolog. Proceedings of the Second International Logic Programming Conference 333–341Google Scholar
  7. Miyazaki T et al. (1985) A Sequential Implementation of Concurrent Prolog Based on Shallow Binding Scheme. Proceedings of 1985 Symposium on Logic Programming 110–118Google Scholar
  8. Sato H et al. (1984) A Sequential Implementation of Concurrent Prolog — based on the Deep Binding Scheme. Proceedings of the First National Conference of Japan Society for Software Science and Technology 299–302, in JapaneseGoogle Scholar
  9. Shapiro E (1983) A Subset of Concurrent Prolog and its Interpreter. Technical Report TR-003. ICOTGoogle Scholar
  10. Shapiro E (1984) Systems Programming in Concurrent Prolog. Conference Record of the 11th Annual ACM Symposium on Principles of Programming Language 93–105Google Scholar
  11. Tanaka J et al. (1984) A Sequential Implementation of Concurrent Prolog — based on the Lazy Copying Scheme. Proceedings of the First National Conference of Japan Society for Software Science and Technology 303–306, in JapaneseGoogle Scholar
  12. Ueda K (1985) Guarded Horn Clauses. Technical Report TR-103. ICOTGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Jiro Tanaka
    • 1
  • Takashi Yokomori
    • 2
  • Makoto Kishishita
    • 3
  1. 1.International Institute for Advanced Study of Social Information Science (IIAS-SIS) Fujitsu LimitedTokyoJapan
  2. 2.IIAS-SIS, Fujitsu Limited 140 MiyamotoShizuokaJapan
  3. 3.Fujitsu Social Science LaboratoryTokyoJapan

Personalised recommendations