Abstract
Exploring and finding alternative paths through a network or a tree structure is often necessary while solving problems. Two issues become relevant: search, focusing on the methods for exploring the structures that describe the problem domains, and control, focusing on how the problem solver selects those methods and shifts attention among its subprocesses.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Coelho, H., Cotta, J.C. (1988). Searching with Prolog. In: Prolog by Example. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83213-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-83213-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-83215-4
Online ISBN: 978-3-642-83213-0
eBook Packages: Springer Book Archive