Heuristic prolog: Logic program execution by heuristic search

  • K. Nakamura
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 221)


This paper presents a language and its system called Heuristic Prolog. The language is an extension of the Edinburgh version Prolog for execution of logic programs by heuristic (best-first) search in addition to depth-first search. The user can specify both the nodes in the search tree to be executed concurrently and priority of the nodes by means of a special built-in predicate. Some example programs in Heuristic Prolog are included to show the capability of the language.


Logic Program Heuristic Search Search Tree Short Route Goal Point 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Boyer RS and Moore JS (1972) The sharing of structure in theorem proving. In: Melzer B, Michie D (eds) Machine Intelligence 7, Edinburgh University Press.Google Scholar
  2. Clocksin WF and Mellish CS (1981) Programming in Prolog, Springer-Verlag, p279Google Scholar
  3. Nakamura K (1984a) Associative evaluation of Prolog programs. In: Campbell CA (ed) Implementations of PROLOG, Ellis Horwood.Google Scholar
  4. Nakamura K (1984b) Associative concurrent evaluation of logic programs, J Logic Programming 2: 285–295CrossRefMathSciNetGoogle Scholar
  5. Nilson NJ (1971) Problem-Solving Methods in Artificial Intelligence, McGraw-Hill, New York, p255Google Scholar
  6. Shimura M (1983) Kikai Chinow Ron (Theory of Machine Intelligence), (in Japanese) Shoukoudou Inc, Tokyo, p310Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • K. Nakamura
    • 1
  1. 1.School of Science and EngineeringTokyo Denki UniversityJapan

Personalised recommendations