Abstract
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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.
Clocksin WF and Mellish CS (1981) Programming in Prolog, Springer-Verlag, p279
Nakamura K (1984a) Associative evaluation of Prolog programs. In: Campbell CA (ed) Implementations of PROLOG, Ellis Horwood.
Nakamura K (1984b) Associative concurrent evaluation of logic programs, J Logic Programming 2: 285–295
Nilson NJ (1971) Problem-Solving Methods in Artificial Intelligence, McGraw-Hill, New York, p255
Shimura M (1983) Kikai Chinow Ron (Theory of Machine Intelligence), (in Japanese) Shoukoudou Inc, Tokyo, p310
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nakamura, K. (1986). Heuristic prolog: Logic program execution by heuristic search. In: Wada, E. (eds) Logic Programming '85. LP 1985. Lecture Notes in Computer Science, vol 221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16479-0_15
Download citation
DOI: https://doi.org/10.1007/3-540-16479-0_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16479-1
Online ISBN: 978-3-540-39820-2
eBook Packages: Springer Book Archive