Searching in a Maze, in search of knowledge: Issues in early artificial intelligence

In Lecture Notes In Computer Science, vol. 4155. Springer. pp. 1-23 (2006)
  Copy   BIBTEX

Abstract

Heuristic programming was the first area in which AI methods were tested. The favourite case-studies were fairly simple toy- problems, 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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
310 (#62,153)

6 months
1 (#1,459,555)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Add more citations

References found in this work

No references found.

Add more references