Abstract
Multiple OR-parallel Resolution (MORE) Prolog is a combination of a pure logic language and control directives expressed as a meta-program. The meta-program affects the default resolution strategy by suspending execution of particular predicates, ordering the suspended processes and selectively reactivating them, thus achieving the desired kind of resolution. In this paper, we formally define the computation process of MORE-Prolog and illustrate how a set of primitive directives could be combined, leading in effect to application of different parallel search algorithms over the same state space. Finally, the effectiveness of MORE-Prolog is demonstrated by presenting different meta-programs which result in different performance if applied on the same logic program.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
R.A. Kowalski: Algorithm=Logic+Control, CACM, 22, 424–431 (1979).
E.L. Lusk, D.H.D. Warren, S. Haridi, et al.: The Aurora OR-Parallel Prolog System, New Generation Computing, 7, 234–271 (1990).
R. Yang, A. Beaumont, I. Dutra, V. Santos-Costa and D.H.D. Warren: Performance of the Compiler Based Andorra-I System, In Proc. of the 10th Int. Conf. on Logic Programming, (1993).
R. Hill: LUSH Resolution and it Completeness, DCS Memo 78, Dept. of Artificial Intelligence, University of Edinburgh, (1974).
J.A. Robinson: A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM, 12:1, 23–41 (1965).
E. Rich and K. Knight: Artificial Intelligence, Mc-Graw Hill, (1992).
I. Vlahavas and P. Kefalas: The AND/OR Parallel Prolog Machine APIM: Execution Model and Abstract Design, Journal of Programming Languages, 1, 245–261, Chapman & Hall (1993).
D.S. Warren: Efficient Prolog Memory Management for Flexible Control Strategies, In Proc. of the 2nd Int. Symp. on Logic Programming, 198–202 (1984)
R. Davis: Meta-rules: Reasoning about Control, Artificial Intelligence, 15:3, 179–222 (1980).
L. Naish: Prolog Control Rules, In Proc. of the Int. Conf. on Artificial Inteligence, IJCAI-85, 720–723 (1985).
M. Dincbas and J-P. LePape: Metacontrol of Logic Programs in Metalog:, In Proc. of the Int. Conf. on Fifth Generation Computer Systems, Elsevier/North-Holland, 361–370 (1984).
H. Gallaire and C. Lasserre: Metalevel control of Logic Programs, In Logic Programming: K.L.Clark, S.A.Tarnlund (eds.), Academic Press, 173–185 (1982).
P. Szeredi: Exploiting Or-parallelism in Optimisation Problems, In Proc. of the 9th Int. Symp. on Logic Programming, 703–716 (1992).
K. Nakamura: Heuristic Prolog: Logic Program Execution by Heuristic Search, In Proc. of the Int. Conf. on Logic Programming 1986, Springer, 149–155 (1986).
T.J. Reynolds and P. Kefalas: Or-Parallel Prolog and Search Problems in Artificial Intelligence Applications, In Proc. of the 7th Int. Conf. on Logic Programming, D.H.Warren and P.Szeredi (eds.), MIT Press, 340–453 (1990).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kefalas, P., Vlahavas, I. (1996). Multiple OR-parallel resolution: Meta-level control of parallel logic programs. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61626-8_91
Download citation
DOI: https://doi.org/10.1007/3-540-61626-8_91
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61626-9
Online ISBN: 978-3-540-70633-5
eBook Packages: Springer Book Archive