Abstract
Pandora was first introduced in [1] as a new parallel logic programming language which combines don't-know non-determinism and stream and-parallelism in a unified and efficient manner. In this paper, we present the Pandora deadlock handler relation whose input argument is a list of meta-level representations of suspended goals. One way of utilizing the deadlock handler relation is in implementing (application-dependent) heuristic search. More generally, the deadlock handler relation can be used to manipulate suspended goals in a flexible manner; redundant goals can be removed, new goals can be added, and a group of goals can be replaced by a simpler group. We illustrate the use of the deadlock handler relation by various application programs and outline the features of the Pandora abstract machine which are required to support its functionality.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bahgat, R.M.R. and Gregory, S. 1989. “Pandora: non-deterministic parallel logic programming”. In Proceedings of the 6th International Conference on Logic Programming, Lisbon, pp.471–486.
Bahgat, R.M.R. 1990. “Symbolic constraint-based reasoning in Pandora”. In Proceedings of the 2nd International Conference of the OUG Artificial Intelligence SIG, London (October).
Bahgat, R.M.R. 1991. “Pandora: non-deterministic parallel logic programming”. PhD Thesis, Dept. of Computing, Imperial College, London University.
Bahgat, R.M.R. 1991. “The Pandora abstract machine: an extension of JAM”. In Proceedings of the ICLP91 Pre-Workshop on Parallel Execution of Logic Programs, 569 Lecture Notes in Computer Science, Springer-Verlag.
Broda, K. and Gregory, S. 1984. “Parlog for discrete event simulation”. In Proceedings of the 2nd International Conference on Logic Programming, Uppsala, Uppsala University Press, pp.301–312.
Clark, K.L. and Gregory, S. 1986. “Parlog: parallel programming in logic”. ACM Transactions on Programming Languages and Systems, 8(1), pp.1–49.
Costa, V.S.: Warren, D.H.D. and Yang, R. 1990a. “The Andorra-I preprocessor: supporting full Prolog on the basic Andorra model”. In Proceedings of the 8th International Conference on Logic Programming, Paris, pp.443–456.
Gregory, S. and Yang, R. 1991. “Parallel Constraint solving in Andorra-I”. Submitted to FGCS92.
Haridi, S. and Janson, S. 1990. “Kernel Andorra Prolog and its computational model”. In Proceedings of the 7th International Conference on Logic Programming, Jerusalem, pp.31–46.
Hickey, T. 1989. “CLP* and constraint abstraction”. In Proceedings of Principles of Programming Languages, Chicago, pp.125–133.
Sakai, K. and Aiba, A. 1987. “Introduction to CAL”. ICOT Technical Report, Tokyo.
Schneider, L. 1991. “An Implementation of Pandora”. MSc. Thesis, Dept. of Computing, Imperial College, London University.
Walinsky, C. 1989. “CLP(ε*): Constraint logic programming with regular sets”. In Proceedings of the 6th International Conference on Logic Programming, Lisbon, pp.181–198.
Warren, D.H.D. 1990. “The extended Andorra model with implicit control”. Presented in the Workshop of the 7th International Conference on Logic Programming, Eilat, Israel.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bahgat, R. (1992). The Pandora deadlock handler meta-level relation. In: Pettorossi, A. (eds) Meta-Programming in Logic. META 1992. Lecture Notes in Computer Science, vol 649. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56282-6_11
Download citation
DOI: https://doi.org/10.1007/3-540-56282-6_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56282-5
Online ISBN: 978-3-540-47505-7
eBook Packages: Springer Book Archive