Abstract
Abstraction search dates back to the early days of artificial intelligence. The central idea is to identify important aspects of a given problem, construct a solution outline that ignores less significant aspects, and use it to guide the search for a complete solution. The applications of this approach take different shapes, and their utility varies widely across systems and domains. The related analytical models give disparate efficiency predictions for specific abstraction techniques; however, researchers agree that a proper abstraction can enhance almost all search systems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Fink, E. (2002). Abstraction. In: Changes of Problem Representation. Studies in Fuzziness and Soft Computing, vol 110. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1774-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1774-4_4
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-2518-3
Online ISBN: 978-3-7908-1774-4
eBook Packages: Springer Book Archive