Skip to main content

Advertisement

Springer Nature Link
Log in

Making exhaustive search programs deterministic

  • Special Issue
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

This paper presents a technique for compiling a Horn-clause program intended for exhaustive search into a GHC (Guarded Horn Clauses) program. The technique can be viewed also as a transformation technique for Prolog programs which compiles away the ‘bagof’ primitive and non-determinate bindings. The class of programs to which our technique is applicable is shown with a static checking algorithm; it is nontrivial and could be extended. An experiment on a compiler-based Prolog system showed that our technique improved the efficiency of exhaustive search by 6 times for a permutation generator program. This compilation technique is important also in that it exploits the AND-parallelism of GHC for parallel search.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Bowen, D. L., Byrd, L., Perira, F. C. N., Pereira, L. M. and Warren, D. H. D.,DECsystem-10 Prolog User’s Manual (Bowen, D. L. ed.), Dept. of Artificial Intelligence, Univ. of Edinburgh, 1983.

  2. Carlsson, M., “On Implementing Prolog in Functional Programming,”Proc. 1984 Int. Symp. on Logic Programming, IEEE Computer Society, pp. 154–159, 1984.

  3. Ciepielewski, A. and Haridi, S., “A Formal Model for OR-Parallel Execution of Logic Programs,”Proc. IFIP ’83 (Mason, R. E. A., ed.), Elsevier Science Publishers B. V., Amsterdam, pp. 299–305, 1983.

    Google Scholar 

  4. Clark, K. L. and Gregory, S., “PARLOG: Parallel Programming in Logic,”Research Report DOC 84/4, Dept. of Computing Imperial College of Science and Technology, London, 1984. Also inACM Trans. Prog. Lang. Syst., Vol. 8, No. 1, pp. 1–49, 1986.

    Google Scholar 

  5. Clark, K. L. and Gregory, S., “Notes on the Implementation of PARLOG,”Research Report DOC 84/16, Dept. of Computing, Imperial College of Science and Technology, London, 1984. Also inJ. of Logic Programming, Vol. 2, No. 1, pp. 17–42, 1985.

    Google Scholar 

  6. Hirakawa, H., Chikayama, T. and Furukawa, K., “Eager and Lazy Enumerations in Concurrent Prolog,Proc. Second Int. Logic Programming Conf., Uppsala Univ., Sweden, pp. 89–100, 1984.

  7. Lloyd, J. W.,Foundations of Logic Programming, Springer-Verlag, Berlin, Heidelberg, New York, Tokyo, 1984.

    MATH  Google Scholar 

  8. Naish, L., “All Solution Predicates in Prolog,”Proc. 1985 Symp. on Logic Programming, IEEE Computer Society, pp. 73–77, 1985.

  9. Reddy, U. S., “Transformation of Logic Programs into Functional Programs,”Proc. 1984 Int. Symp. on Logic Programming, IEEE Computer Society, pp. 187–196, 1984.

  10. Shapiro, E. Y., “A Subset of Concurrent Prolog and Its Interpreter,”ICOT Tech. Report TR-003, Institute for New Generation Computer Technology, Tokyo, 1983.

  11. Ueda, K., “Guarded Horn Clauses,”ICOT Tech. Report TR-103, Institute for New Generation Computer Technology, Tokyo, 1985. Also inProc. Logic Programming ’85 (Wada E., ed.), Lecture Notes in Computer Science 221, Springer-Verlag, Berlin, Heidelberg, pp. 168–179, 1986.

    Google Scholar 

  12. Ueda, K., “Guarded Horn Clauses,”Doctoral Thesis, Information Engineering Course, Faculty of Engineering, Univ. of Tokyo, 1986.

  13. Ueda, K., “Guarded Horn Clauses: A Parallel Logic Programming Language with the Concept of a Guard,”ICOT Tech. Report TR-208, Institute for New Generation Computer Technology, Tokyo, 1986.

    Google Scholar 

  14. Ueda, K. and Chikayama, T., “Concurrent Prolog Compiler on Top of Prolog,”Proc. 1985 Symp. on Logic Programming, IEEE Computer Society, pp. 119–126, 1985.

  15. Warren, D. H. D., “Higher-order extensions to PROLOG: are they needed?,” inMachine Intelligence, 10 (Hayes, J. E., Mitchie, D. and Pao, Y.-H., eds.), Ellis Horwood, Chichester, England, pp. 441–454, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ICOT Research Center, Institute for New Generation Computer Technology, 4-28, Mita 1-chome, Minato-ku, 108, Tokyo, Japan

    Kazunori Ueda

Authors
  1. Kazunori Ueda
    View author publications

    You can also search for this author inPubMed Google Scholar

About this article

Cite this article

Ueda, K. Making exhaustive search programs deterministic. New Gener Comput 5, 29–44 (1987). https://doi.org/10.1007/BF03037456

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037456

Keywords