ASSIGNMENT #4
ARTIFICIAL INTELLIGENCE I
Out: November 10
Due: November 24, 2014
38 POINTS
5 points Extra Credit.
No credit will be given for Extra Credit unless all four required questions are answere
ASSIGNMENT #3
ARTIFICIAL INTELLIGENCE I
OCTOBER 27, 2014
DUE NOVEMBER 10, 2014
38 POINTS
11 points.
1. Medical diagnosis With a CLIPS Based Expert System. (4 points)
a. Run the following CLIPS program
ASSIGNMENT #5
ARTIFICIAL INTELLIGENCE I
November 24, 2014
38 POINTS
Due December 8, 2014
No late submissions will be accepted for this
assignment.
See syllabus for details.
10 points. 5 points each.
1
Chapter 1 Kopec
Introduction
While we have a wealth of technology available to us, often it is employed for entertainment, not
necessarily problem solving.
One goal of the course is to understand how
Logical reasoning
Automatic generation of deductive proofs in Mathematical Logic:
First, look at the Propositional Calculus \
We start with a set of statements {S} that can be veriﬁed as T or F. Such
CSC 6800
Knowledge Representation
Today Representation of knowledge
Procedural Knowledge — knowing how to do something
Declarative knowledge - knowing that a statement is true or false.
Tacit knowledg
CSC 6800
Search Using Games
Up to this point the only obstacle to progress is the complexity ofthe search space.
In this chapter we add an adversary.
We start by looking at how to express game play in
Environments and Lighting
Last time terrain texture:
Trees:
Pros: Trees generated by the Terrain Engine can be animated to sway in the breeze. They
also have automatic LOD: At a certain distance, the
Uninformed Search Examples
The Other 188116 15 what information is available on the graph to use,
n for the first iteration
Fir ' -
_ _st assume no cost information:
steps. The comments in brackets de
“In
Chapter H
l
. In the previous, lecfumWe looked at uninformed search approaches. Below is a
comparison between the two that we have looked at.
. . ’A—‘ni .-. .7. .53. um ,_.-.w-,—~_-v- .-w.-.-_
Problem Solving
(Kopec, Chapter 2)
Problem Solving stagesl
1. Representing the problem in terms of the percelved goals. (data structures)
2. Create a plan for the problem's solution. (algorithm) lnfor
CSC 6800
Path Planning in Real World Scenarios Using state Space Search:
Need to represent the problem in terms ofa graph.
f‘hr‘r 1"
Informed Search
Uses problem speciﬁc knowledge beyond the defi
CSC 6800
Uninformed Search continued.
Uninformed search uses only knowledge about the definition of the problem to solve the problem.
They have no more information about a states than is provided in t
Lecture 1
Introduction to AI
AI concerns the intelligent behavior of artifacts. Artifacts are things created by man.
Intelligent behavior involves the perception, reasoning, learning, and communicatin
Lecture 3
CSC 6800
Fall 2013
Uninformed Search
Chapter 2.
Search is a basic mechanism for problem solving. Search is often used by us in an intuitive fashion.
Formal introduction to basic search mecha
Free Online Version
http:/www.learnprolognow.org
Learn Prolog Now!
by
P. Blackburn,
J. Bos,
K. Striegnitz
Overview
Prolog is a programming language, but a rather unusual one. &'grave;Prolog' is short
2.
a) Perform the minimax evaluation for the game tree
Ans)
2.b) Use alpha beta pruning to evaluate the tree above. Be sure to indicate all the alpha cut offs and beta
cut offs. Specify the alpha and