home

Notes on GOFAI

Lecture 1

Introduction

  • AI is the study of building models. Models targeted at ‘thinking’, and action and perception.
  • We focus on building the right ‘representations’ that support those above models. Having the right representations makes it easy to think about building models.

Lecture 2: Goal Trees and Problem Solving

Symbolic Integration Programs

To solve problems we break the problem down into smaller chunks and solve them. [todo find the graph Prof drew]

  • it encodes a few ‘safe’ transforms. approx 12
  • it encodes a few heuristics.
  • then the program parses the problem, and applies the above rules on them.
  • It constructs a tree, breaking the problem down sub-problems – represented by using AND nodes.
  • Sometimes when multiple transforms can be applied, an OR node is used.
  • Some heuristics are encoded on problem section: ie on which OR node to choose. For example: choosing hte one with the least nested function composition.
  • All leaf nodes under an AND node have to be solved. Only one under an ‘OR’ node need to be solved.

Generate and Test Generate and Test is a fundamental and a strong + simple idea in AI.

alt text

alt text

  • Meta-knowledge (and I think by extension meta-knowledge are important tools).
  • “Knowledge about knowledge is where the power is.” For example in classic expert systems (such as SAINT) organizing the knowledge, seeing the patterns in what to encode, and how to encode/represent the problem made the program much more efficient.

alt text

  • “I also expect that your feeling of intelligence of this program (Symbolic Integrator) is diminished.When we understand how something works, its intelligence seems to vanish”

Lecture 3 ‘Reasoning: Goal Trees and Rule-based expert systems’

A program can be implemented such that it implements a goal tree.

It can answer ‘why did you do that’ questions based on what comes ‘above’ (parent node) in the goal tree, and it can answer ‘how’ questions by looking at what comes below (child nodes) in the goal tree.