Thomas Jefferson High School for Science and Technology

Artificial Intelligence Outline

I. The LISP programming language
A. Structure of Lisp
  1. Symbolic expressions: atoms/numbers/lists
  2. Program
  3. "Box & Pointer"
  4. Variable bindings/Environment/Scope
B. Lisp Primitives
  1. Cons/Append/List/Replaca
  2. Read/Print
  3. Predicates
  4. Conditionals: If/Cond
C. Looping
  1. Recursion: tail end, single, double
  2. Iteration: do - parallel, do - sequential
AI Logo
II. Basic AI Topics
A. Productions and Matching
  1. Production Systems: Unordered, Ordered, Discrimination Nets
  2. Matching
B. Knowledge Representation (Overview)
  1. Production Rules
  2. ISA and AKO Hierarchies
  3. Augmented Transition Nets
  4. Predicate Calculus
C. Searches
  1. Depth First
  2. Breadth First
  3. Best First
  4. Heuristic
D. Logical Reasoning
  1. Propositional Logic
  2. Wang's Algorithm
  3. Predicate Calculus
    a. Axioms
    b. Proofs: Resolution, Clause Form, Unification Algorithm
  4. Three State Logic
III. Genetic Algorithms
A. Population
  1. Representation
  2. Construction
B. Fitness
  1. Function
  2. Calculation
C. Mating
D. Crossover
E. Reproduction

Instructors

Phyllis T. Rittman
prittman@tjhsst.edu
Randy Latimer
rlatimer@tjhsst.edu