Advertisement

Managing search in parallel logic programming

  • Hayato Ohwada
  • Fumio Mizoguchi
Parallel Architecture Aad Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 315)

Abstract

This paper explores a new parallel logic programming technique for managing state-space search in problem solving. The technique can be characterized as a parallel search strategy to obtain reasonable solutions efficiently in contrast with any sequential search strategy. Using the strategy, it is possible to search a solution space in a parallel exhaustive manner, focus on possible alternatives simultaneously and control all search processes for efficient search. These capabilities are due to expressive power of parallel logic programming; particularly parallelism and communication via shared variables. To demonstrate its expressive power, we show several simple programs written in Flat GHC on top of DEC-10 Prolog. These programs illustrate that the parallel search strategy allows to implement search programs efficiently within Horn-clause logic differently from other programming techniques.

Keywords

Logic Program Search Process Logic Programming Search Program Parallel Search 
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. Bowen, D. L. (ed.), Byrd, L., Pereira, L. M. and Warren, D. H. D. [1983] DECsystem-10 Prolog User's Manual, Dept. of Artificial Intelligence, Univ. of Edinburgh.Google Scholar
  2. Burstall, R. M. and Darlington, J. [1977] A Transformation System for Developing Recursive Programs, J. ACM, Vol. 24, No. 1, (1977),pp. 44–67.Google Scholar
  3. Clark, K. L., McCabe, F., Gregory, S. [1982] IC-Prolog Language features, In Logic Programming, Clark, K. L. and Tarnlund, S. A. (ed.), Academic Press, pp. 253–266.Google Scholar
  4. Dincbas, M. [1986] Constraints, Logic Programming and Deductive Databases, In Proc. Frans-Japan Arti. Intell. and Computer Science Symp. 86, pp. 1–27.Google Scholar
  5. Dincbas, M. and Pape, J. L. [1984] Metacontrol of Logic Programs in Metalog, In Proc. Int. Conf. of Fifth Generation Computer Systems 1984, ICOT, pp. 361–370.Google Scholar
  6. Gallaire, H. and Lasserre, C. [1982] Metalevel control for logic programs, In Logic Programming, Clark, K. L. and Tarnlund, S. A. (ed.), Academic Press, pp. 173–185.Google Scholar
  7. Shapiro, E. Y. and Takeuchi, A. [1983] Object Oriented Programming in Concurrent Prolog, New Generation Computing, Vol. 1, No. 1 (1983), pp. 25–48.Google Scholar
  8. Tamaki, H. and Sato, T. [1984] Unfold/Fold Transformation of Logic Programs, In Proc. Second Int. Logic Programming Conf., Uppsala Univ., Sweden, pp. 127–138.Google Scholar
  9. Takeuchi, A. and Furukawa, K. [1986] Parallel Logic Programming Languages, In Proc. Third Int. Logic Programming Conf, Imperial College of Science and Technology, London, pp. 242–254.Google Scholar
  10. Ueda, K. [1985] Guarded Horn Clauses, ICOT Tech. Report TR-103, Institute for New Generation Computer Technology. Also in Lecture Notes in Computer Science, Springer-Verlag, Berlin Heidelberg (1986).Google Scholar
  11. Ueda, K. [1986a] Making Exhaustive Search Programs Deterministic, In Proc. Third Int. Logic Programming Conf., Imperial College of Science and Technology, London, pp. 270–282.Google Scholar
  12. Ueda, K. [1986b] Making Exhaustive Search Programs Deterministic (II), In Proc. Third National Conf. of Japan Society of Software Science and Technology (in Japanese), Tokyo, pp (1)–(8).Google Scholar
  13. Ueda, K. and Chikayama, T. [1985] Concurrent Prolog Compiler on Top of Prolog, In Proc. 1985 Symp. on Logic Programming, IEEE Computer Society, pp. 119–126.Google Scholar
  14. van Emden, M. H. and de Lucena Filho, G. J. [1982] Predicate logic as a programming language for parallel programming, In Logic Programming, Clark, K. L. and Tarnlund, S. A. (ed.), Academic Press, pp. 189–198.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Hayato Ohwada
    • 1
  • Fumio Mizoguchi
    • 1
  1. 1.Dept. of Industrial AdministrationScience Univ. of TokyoNoda, ChibaJapan

Personalised recommendations