The breadth of A. I. is explored and explained in this best selling text. Assuming no prior knowledge,it covers topics like neural networks and robotics. This text explores the range of problems which have been and remain to be solved using A. I. tools and techniques. The second half of this text is an excellent reference.
What Is Artificial Intelligence?
Problems Problem Spaces and Search
Heuristic Search Techniques
21 other sections not shown
Other editions - View all
Abbott agents algorithm answer apply approach ARMEMPTY assertions axioms backpropagation backtracking belief best-first search breadth-first search called Chapter chess clauses complete concept conceptual dependency connectionist consider contains corresponding define depth-first depth-first search described discussed domain example expert systems fact goal grammar graph heuristic heuristic function Hopfield networks important inference initial input instance interpretation justification knowledge base knowledge representation labeled learning Marcus match methods minimax move MYCIN natural language node nonmonotonic object ON(B operators output units parsing particular path perceptron perform possible preconditions predicate logic problem problem-solving procedure produce production system PROLOG propagation question reasoning represent result robot rules script Section semantic semantic net sentence shown in Figure simple slot solution solve specific step strategy structure Suppose syntactic task techniques theorem things tree truth maintenance system variables version space weights