# 2008 ArtificialIntelligenceASystemsApproach

- (Jones, 2008) ⇒ M. Tim Jones. (2008). “Artificial Intelligence: A Systems Approach.” Jones & Bartlett. ISBN:0763773379

**Subject Headings:** Artificial Intelligence Textbook.

## Notes

## Quotes

### Book Overview

This book offers students and AI programmers a new perspective on the study of artificial intelligence concepts. The essential topics and theory of AI are presented, but it also includes practical information on data input & reduction as well as data output (i.e., algorithm usage). Because traditional AI concepts such as pattern recognition, numerical optimization and data mining are now simply types of algorithms, a different approach is needed. This sensor / algorithm / effecter approach grounds the algorithms with an environment, helps students and AI practitioners to better understand them, and subsequently, how to apply them. The book has numerous up to date applications in game programming, intelligent agents, neural networks, artificial immune systems, and more.

### 3 Informed Search

### Constraint-Satisfaction Algorithm

A large number algorithms exist to solve CSPs from the simple *Generate and Test* algorithm to constraint-propagation and consistency. We'll explore a few of the available algorithms that can be used. Note that some of the algorithms we've discussed thus far (such as depth-first search invested in Chapter 2, and simulated annealing and Tabu search from Chapter 3) can be used effectively to solve CSPs

### Generate and Test

*Generate and Test* is the simplest of the algorithms to identify a solution for a CSP. In this algorithm, each of the possible solutions is attempted (each value enumerated for each variable) and then tested for the solution. Since testing each combination of variable within the domain of each value can be extremely slow and inefficient, heuristics can be applied to avoid those combination that are outside of the solution space.

### Backtracking

The *backtracking* algorithm operates with a simple uninformed search algorithm, such as depth-first search. At each node, a variables is instantiated with a value and the constraint violations are checked. If the values are legal, search is permitted to continue, otherwise, the current branch is abandoned and the next node from the OPEN list is evaluated.

,

Author | volume | Date Value | title | type | journal | titleUrl | doi | note | year | |
---|---|---|---|---|---|---|---|---|---|---|

2008 ArtificialIntelligenceASystemsApproach | M. Tim Jones | Artificial Intelligence: A Systems Approach | http://books.google.com/books?id=ekUHwvRP7nUC | 2008 |