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.
This research has been carried out as a part of Fifth Generation Computer Project.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Clark K, Gregory S (1984) Notes on Systems Programming in Parlog. Proceedings of the International Conference on Fifth Generation Computer Systems 299–306
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 Japanese
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 Japanese
Furukawa K et al. (1984) The Conceptual Specification of the Kernel Language Version 1. Technical Report TR-054. ICOT
Hirakawa H et al. (1984) Eager and Lazy Enumeration in Concurrent Prolog. Proceedings of the Second International Logic Programming Conference 89–100
Levy J (1984) A Unification Algorithm for Concurrent Prolog. Proceedings of the Second International Logic Programming Conference 333–341
Miyazaki T et al. (1985) A Sequential Implementation of Concurrent Prolog Based on Shallow Binding Scheme. Proceedings of 1985 Symposium on Logic Programming 110–118
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 Japanese
Shapiro E (1983) A Subset of Concurrent Prolog and its Interpreter. Technical Report TR-003. ICOT
Shapiro E (1984) Systems Programming in Concurrent Prolog. Conference Record of the 11th Annual ACM Symposium on Principles of Programming Language 93–105
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 Japanese
Ueda K (1985) Guarded Horn Clauses. Technical Report TR-103. ICOT
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tanaka, J., Yokomori, T., Kishishita, M. (1986). And-or queuing in Extended Concurrent Prolog. In: Wada, E. (eds) Logic Programming '85. LP 1985. Lecture Notes in Computer Science, vol 221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16479-0_16
Download citation
DOI: https://doi.org/10.1007/3-540-16479-0_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16479-1
Online ISBN: 978-3-540-39820-2
eBook Packages: Springer Book Archive