Skip to main content
SpringerLink
Log in

Control of logic program execution based on the functional relation

  • Session 5a: Program Analysis
  • Conference paper
  • First Online:
Third International Conference on Logic Programming (ICLP 1986)

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

Included in the following conference series:

Abstract

This paper is concerned with the use of the information about the functional relations in logic programs to eliminate unnecessary recomputation. The method can be applied to control the execution of logic programs by specifying the functional relations so that no undesirable solution is generated. Some fundamental properties of the functionality in logic programs is discussed and a condition for the applicability of a specified functional relation to a goal is shown.

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

  • Carlsson, M. and Kahn, K.M. (1983), LM-Prolog User Manual, Technical Report No. 24, UPMAIL, Computing Science Department, Uppsala University, Sweden.

    Google Scholar 

  • Clark, K. L. (1979), Predicate logic as a computational formalism, Research Monograph 79/59 TOC, Department of Computing, Imperial College, London.

    Google Scholar 

  • Clark, K. L., McCabe, F.G., and Gregory, S. (1982), IC-Prolog language features, in (Clark, K. L. and Tärnlund, S-Ã…. eds.) Logic Programming, Academic Press, London, pp.253–266.

    Google Scholar 

  • Clocksin, W.F. and Mellish, C.S. (1981), Programming in Prolog, Springer-Verlag, Berlin.

    Google Scholar 

  • Hansson, Ã…, Harridi, S., and Tärnlund, S-Ã…. (1982), Properties of a logic programming language, in (Clark, K. L. and Tärnlund, S-Ã…. eds.) Logic Programming, Academic Press, London, pp.267–280.

    Google Scholar 

  • Mellish, C. S. (1980), An alternative to structure sharing in the implementation of a PROLOG interpreter, Research Paper 150, Department of Artificial Intelligence, University of Edinburgh.

    Google Scholar 

  • Mellish, C. S. (1985), Some global optimizations for a PROLOG compiler, Jour. of Logic Programming Vol. 2, No. 1, pp.43–66.

    Google Scholar 

  • Nakamura, K. (1985), Heuristic Prolog: logic program execution by heuristic search, in Proc. of Logic Programming Conference, ICOT, also to appear in Lecture Notes in Computer Science, Springer-Verlag.

    Google Scholar 

  • Nilson, M. (1984), Declarative determinism in Prolog implementations, UPMAIL, Computing Science Department, Uppsala University, Sweden.

    Google Scholar 

  • Warren, D. H. D. (1977), Implementing PROLOG-compiling predicate logic programs, Research Report Nos.39 and 40, Dept. of Artificial Intelligence, University of Edinburgh.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Science and Engineering, Tokyo Denki University, Hatoyama-machi, 350-03, Saitama-ken, Japan

    Katsuhiko Nakamura

Authors
  1. Katsuhiko Nakamura
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ehud Shapiro

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nakamura, K. (1986). Control of logic program execution based on the functional relation. In: Shapiro, E. (eds) Third International Conference on Logic Programming. ICLP 1986. Lecture Notes in Computer Science, vol 225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16492-8_98

Download citation

  • DOI: https://doi.org/10.1007/3-540-16492-8_98

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16492-0

  • Online ISBN: 978-3-540-39831-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation