Searching in a Maze, in Search of Knowledge: Issues in Early Artificial Intelligence

Abstract Heuristic programming was the first area in which AI methods were tested. The favourite case-studies were fairly simple toyproblems, such as cryptarithmetic, games, such as checker or chess, and formal problems, such as logic or geometry theorem-proving. These problems are well-defined, roughly speaking, at least in comparison to real-life problems, and as such have played the role of Drosophila in early AI. In this chapter I will investigate the origins of heuristic programming and the shift to more knowledge-based and real-life problem solving.
Keywords No keywords specified (fix it)
Categories No categories specified (fix it)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 5,705
External links
  •   Try with proxy.
  • Through your library Only published papers are available at libraries

    Similar books and articles
    Roberto Cordeschi (2006). Searching in a Maze, in Search of Knowledge: Issues in Early Artificial Intelligence. In O. Stock & M. Schaerf (eds.), Lecture Notes In Computer Science. Springer-Verlag.

    Analytics

    Monthly downloads

    Sorry, there are not enough data points to plot this chart.

    Added to index

    2010-12-22

    Total downloads

    1 ( #274,982 of 549,224 )

    Recent downloads (6 months)

    1 ( #63,397 of 549,224 )

    How can I increase my downloads?


    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.

    Other forums