Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computer Logic

COLOG 1988: COLOG-88 pp 232–241Cite as

On the problem of reducing search in logic program execution

  • Conference paper
  • First Online:

  • 162 Accesses

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Clocksin W.F., Mellish C.S. Programming in Prolog. Springer-Verlag, 1981.

    Google Scholar 

  2. Cox P.T. Finding backtrack points for intelligent backtracking. In: Implementations of Prolog, 1984, p.216–233.

    Google Scholar 

  3. Hirakawa H., Onai R., Furukawa K. Or-parallel optimizing Prolog system: POPS. Lecture Notes in Computer Science, 1986, v.220, p.114–129.

    Google Scholar 

  4. Kowalski R. Logic for problem solving. North-Holland, 1979.

    Google Scholar 

  5. Loveland D.W. An implementation of the model elimination proof procedure. Journal of the ACM, 1974, v.21, p.124–139.

    Google Scholar 

  6. Neiman V.S. Deduction search with single consideration of subgoals. Soviet Math. Dokl., 1986, v.33, p.251–254.

    Google Scholar 

  7. Neiman V.S. The system PROVE — implementation of the subgoal extraction method. Preprint institute of Theoretical Astronomy. Leningrad, 1986 (in Russian).

    Google Scholar 

  8. Neiman V.S. Refutation search for Horn sets by subgoal extraction method. Journal of Logic Programming, 1989 (to appear).

    Google Scholar 

  9. Neiman V.S. Using partially defined terms in logic inferences. Proc. of "Theory and applications of Artificial intelligence". Bulgaria, Sozopol, 1988, v.2, p.241–248 (in Russian).

    Google Scholar 

  10. Pereira L.M., Porto A. Selective backtracking. In: Logic programming. Academic Press, 1982, p.107–114.

    Google Scholar 

  11. Tamaki H., Sato T. OLD resolution with tabulation. Lecture Notes in Computer Science, 1986, v.225, p.84–98.

    Google Scholar 

  12. Wolfram D.A., Maher M.J., Lasser J.L. A unified treatment of resolution strategies for logic programs. In: Second 1nt. Logic Programming Conf., 1984, p.263–276.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Astronomy, Academy of Sciences of the USSR, 10, Qutuzov Quay, 191187, Leningrad, USSR

    V. S. Neiman

Authors
  1. V. S. Neiman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Per Martin-Löf Grigori Mints

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Neiman, V.S. (1990). On the problem of reducing search in logic program execution. In: Martin-Löf, P., Mints, G. (eds) COLOG-88. COLOG 1988. Lecture Notes in Computer Science, vol 417. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52335-9_56

Download citation

  • DOI: https://doi.org/10.1007/3-540-52335-9_56

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46963-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation