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

2Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

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. © 2006 Springer-Verlag Berlin/Heidelberg.

Cite

CITATION STYLE

APA

Cordeschi, R. (2006). Searching in a maze, in search of knowledge: Issues in early artificial intelligence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4155 LNAI, pp. 1–23). Springer Verlag. https://doi.org/10.1007/11829263_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free