Skip to main content
SpringerLink
Log in

Managing search in parallel logic programming

  • Parallel Architecture Aad Programming
  • Conference paper
  • First Online:
Logic Programming '87 (LP 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 315))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • 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 

  • 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 

  • 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 

  • 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 

  • 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 

  • 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 

  • 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 

  • 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 

  • 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 

  • 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 

  • 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 

  • 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 

  • 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 

  • 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 

Download references

Author information

Authors and Affiliations

  1. Dept. of Industrial Administration, Science Univ. of Tokyo, 278, Noda, Chiba, Japan

    Hayato Ohwada & Fumio Mizoguchi

Authors
  1. Hayato Ohwada
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fumio Mizoguchi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Koichi Furukawa Hozumi Tanaka Tetsunosuke Fujisaki

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ohwada, H., Mizoguchi, F. (1988). Managing search in parallel logic programming. In: Furukawa, K., Tanaka, H., Fujisaki, T. (eds) Logic Programming '87. LP 1987. Lecture Notes in Computer Science, vol 315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19426-6_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-19426-6_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19426-2

  • Online ISBN: 978-3-540-39267-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation