CSE 5360 Spring 1995 - Outline for Exam 2

Exam is closed-book, closed-notes.

Prolog and Search
- basic Prolog programming and concepts
- depth first
  - depth-limited
  - iterative deepening
- breadth first
- best first

Knowledge
- logic-based agent
- first-order predicate calculus
- situation calculus
- causal and diagnostic rules

Planning
- planning agent
- advantages over problem-solving agent
- initial and goal states
- operators
  - STRIPS representation
- partial-order planning
  - plan steps
  - step ordering constraints
  - variable binding constraints
  - causal links (protection intervals)
- protecting causal links
  - promotion
  - demotion
- hierarchical decomposition
- conditional effects
- conditional planning
  - simple replanning agent
- execution monitoring
  - situated planning agent
- goal regression
- wumpus world planning operators

Uncertainty
- decision-theoretic agent
  - rational agent
- decision theory
  - probability theory
    - conditional probability
    - Bayes rule
  - utility theory
- belief networks
  - nodes
  - links
  - conditional probability tables
  - belief network inference
  - belief network for wumpus world
- decision networks
  - decision nodes
  - utility nodes
  - evaluation of actions



                                             (over)

Learning
- learning agent
- measuring performance
  - learning curve
- decision-tree induction
  - decision tree
  - outline of algorithm
  - attribute selection
    - information theory
      - gain formula
- version space
  - definition
- networks
  - neural networks
    - input, hidden, output nodes
    - weights
    - activation function
  - Bayesian learning
  - differences between neural and belief networks
- reinforcement learning
  - state utilities
  - action state (Q) values
  - passive (know formulae)
    - adaptive dynamic programming (ADP)
    - temporal difference learning (TD)
  - active (action-value) (know formulae)
    - ADP-based
    - TD-based
- explanation-based learning (EBL)
  - input/output specification
- inductive logic programming (ILP)
  - inverse resolution
  - top-down approach
    - FOIL
      - outline of algorithm
      - selecting new literals

Natural Language
- communicating agent
- phrase structure
- definite clause grammar (DCG)
  - use of variable augmentation
  - use of code augmentation (curly braces)
- semantic interpretation
  - English grammar with logic-based semantics
    - quasi-logic augmentations
    - quantification (exists, forall)
- DCG format in Prolog