Abstract
Nolimit is a completely implemented nonlinear planner that uses an intelligent casual-commitment strategy to guide its search process. The casualcommitment method used to achieve its nonlinear character is in contrast to the least-commitment strategy used in other nonlinear planners. Nolimit has the ability to call user-given or automatically acquired control knowledge in the form of control rules or guiding cases at all its choice points. The subsequent chapters of this book describe the extensions of Nolimit into an analogical problem solver that replays past problem solving episodes.
Preview
Unable to display preview. Download preview PDF.
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1994). The problem solver. In: Veloso, M.M. (eds) Planning and Learning by Analogical Reasoning. Lecture Notes in Computer Science, vol 886. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58811-6_3
Download citation
DOI: https://doi.org/10.1007/3-540-58811-6_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58811-5
Online ISBN: 978-3-540-49109-5
eBook Packages: Springer Book Archive