Generic Tasks


CSCI 222: Read Chapters 11 and 12


A task-specific knowledge-based technique devoted to taxonomizing a collection of techniques that characterize specialized combinations of domain and control knowledge

Domain knowledge - knowledge about a given domain. Needed: organization

Control knowledge - knowledge about how to solve a task (inference engine)
Needed: methodology

Tasks of particular interest: (due to ubiquity)

Structured Matching
Classification
Abduction
Design (Planning)

Data Retrieval Problem Solver
      (intelligent database? ask database before user)


Knowledge Groups : (Structured Matching)

History: Samuel's Signature Tables

Problem: Selecting one choice out of a small number of alternatives based on a given set (usually several possibilities) of parameters.

Matching requires too much processing (too many alternatives to list all possibilities)
These same choices are made often (in possibly varying situations)

Solution: Organize decisions into meaningful groups

Example:		

			   Goodness
			/            \
	     defensibility       offensive opportunities





Example:			      Bad Fuel
				    /          \
				   /            \
  			 Performance	  FillUp Related
   			  Related

BadFuel:	
	Performance Related		FillUp Related	
	(EQ 3)			(GE 0)        ==>  3
	(EQ 1)			(GE 0)        ==>  2
	   ?			(LT 0)        ==>  -3

Performance Related:
	Q1:  Ask YNU? "Is the car slow to respond"
	Q2: Ask YNU? "Does the car start hard"
	Q3: (And Ask YNU? "Do you hear knocking or pinging sounds"
		or   Ask YNU? "Does the problem occur while accelerating")

		Q1			Q2			Q3	
		(EQ T)		 	?			 ?		==> -3
		  ?			(EQ T)         		 ?		==> -3
		  ?			?			(EQ T)		==> 3
		  ?			 ?			  ?		==> 1


FillUp Related:	
	Q1:  Ask YNU? "Have you tried a higher grade of gas"
	Q2: Ask YNU? "Did the problem start after the last fillup"
	Q3: Ask YNU? "HAs the problem gotten worse since the last fillup"
			    
	Q1		Q2			Q3	
	(EQ T)		?			 ?		==> -3
	?		(EQ T)         		 ?		==> 3
	?		(EQ F)			(EQ T)		==> 2
	?	 	?			  ?		==> -3

Often the top level compares evidence from different source types, for example,
Chemical Evidence, Physical Evidence (Historical and Exam), Imagery (X-ray)

See figures 1-5 in "Structured Matching: A Task-Specific Technique for Making Decisions"

Also see section 3.1, "HYPER" for some specifics on representation and control

Issues:

Structured Matching

Task Formulation:

Form of Knowledge:

Organization of Knowledge:

Method:


Classification Knowledge
Organization & Form

For each hypothesis, set up a subtask to establish or reject it. If it is established, test its successors. If it is rejected, it and its successors are rejected. The top-down control strategy, called Establish-Refine, can be varied under specific conditions. [T. Bylander and S. Mittal. CSRL: A Language for Classificatory Problem Solving and Uncertainty Handling. AI Magazine 7(3):66-77, 1986] elaborate on this simplified account.

Specialists:

Advantages:

(* note: these could be rules, could be logic, could be frames, could be pattern recognition, etc.

The organization is important, not the lower level implementation choice)

- nodes higher in the hierarchy represent general hypothesis; lower represent more specific hypothesis (top-down)

Classification Control:
Establish/Refine

Establish: specialist establishes because relevant (high confidence)

Refines by invoking subs

       (which then perform establish/refine)

Reject: confidence low - performs no further actions - prunes hierarchy

Suspend: moderate confidence - may later refine if requested (blackboard - secondary to...)

      * non establish-set lower ; ask for more info

Recommendation: pathognomonic rules

Succinctly:

Classification

Knowledge Representative primitives:

  1. Classification hierarchy
           subclass of, superclass of
  2. Classificatory knowledge implies a specific organization

Organization of Knowledge:

Control Regime:
Variations on establish-refine on the hierarchy of concepts

Goal Types:
Establish , reject , suspend <>, refine<>, explain

See "CSRL: A Language for Expert Systems for Diagnosis"


Abduction

Generation of explanation

(if a b)
b .
a

(If ( drunk ?person) (not (walk-straight ?person)
(not (walk-straight Jack) .
(drunk Jack)

Only a guess...Not a valid logical implication

Jack could have just got off a roller coaster.

Abduction is only plausible inference

Careful : Our notion of explanation => causality

causality and logical implication are not the same thing

(if (in ?patient ward5) (have ?patient cancer))
(have Eliza cancer) .
(in Eliza ward5)

(cause  ?x  ?y)        : x causes y
?y                  .  : and y is true 
?x                     : so hypothesize ?x as explanation

Diagnosis:

D is a collection of data (facts, observations)
Hypothesis H is plausible under the circumstance
H explains D (would, if true, explain D)
No other hypothesis explains D as well as H does
Therefore, H is correct

Abductions go from data describing something, to an explanatory hypothesis that best accounts for that data. Other names

inference to the best explanation

the explanatory inference

The mechanism:

a) a classification machine for selecting plausible hypotheses

b) a specialized means-ends machine for assempling plausible hypotheses into a best explanation.

The assembler is used repeatedly by an overview critic which

Hypothesis interaction: Want composite hypothesis which is

Each plausible hypothesis delivered by the classifier comes with:

Means-ends

One knows what they want to achieve
and what they have. Means-ends centers around the detection of differences between the current state and the goal state...and what means can be used to get to the goal state


Design by Plan Selection and Refinement

Task:

Method:

See
design notes for more