Advertisement

Control of logic program execution based on the functional relation

  • Katsuhiko Nakamura
Session 5a: Program Analysis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 225)

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.

Keywords

Logic Program Functional Relation Unit Clause Prolog Program Logic Programming Language 
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. Carlsson, M. and Kahn, K.M. (1983), LM-Prolog User Manual, Technical Report No. 24, UPMAIL, Computing Science Department, Uppsala University, Sweden.Google Scholar
  2. Clark, K. L. (1979), Predicate logic as a computational formalism, Research Monograph 79/59 TOC, Department of Computing, Imperial College, London.Google Scholar
  3. 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
  4. Clocksin, W.F. and Mellish, C.S. (1981), Programming in Prolog, Springer-Verlag, Berlin.Google Scholar
  5. 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
  6. 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
  7. Mellish, C. S. (1985), Some global optimizations for a PROLOG compiler, Jour. of Logic Programming Vol. 2, No. 1, pp.43–66.Google Scholar
  8. 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
  9. Nilson, M. (1984), Declarative determinism in Prolog implementations, UPMAIL, Computing Science Department, Uppsala University, Sweden.Google Scholar
  10. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Katsuhiko Nakamura
    • 1
  1. 1.School of Science and EngineeringTokyo Denki UniversitySaitama-kenJapan

Personalised recommendations