6.825 Techniques in Artificial Intelligence
Satisfiability and Validity
Lecture 4 1
Last time we talked about propositional logic. There's no better way to empty out a
room than to talk about logic. So now, - having gone to all that work of
establishing s
6.825 Techniques in Artificial Intelligence
Logic
Lecture 3 1
Today we're going to start talking about logic. Now, my guess is that almost
everybody's been exposed to basic propositional logic in the context of
machine architecture or something like that.
6.825 Techniques in Artificial Intelligence
Problem Solving and Search
Problem Solving
Lecture 2 1
Last time we talked about different ways of constructing agents and why it is
that you might want to do some sort of on-line thinking. It seems like, if you
6.825 Recitation Problems: Spring Final
Solutions
December 13, 2001
1
Gaussian Units
You were not responsible for this problem.
2
Network Structure
Nodes A and B have no parents.
Node C has two parents: A and B
Node D has one parent: C
3
At the Races
1. Y
6.825 Techniques in Artificial Intelligence
What is Artificial Intelligence (AI)?
Lecture 1 1
If you're going to teach or take an AI course, it's useful to ask: "What's AI?"
It's a lot of different things to a lot of different people. Let's go through a f
6.825 Techniques in Artificial Intelligence
First-Order Logic
Lecture 5 1
At the end of the last lecture, I talked about doing deduction and propositional logic
in the natural deduction, high-school geometry style, and then I promised you
that we would lo
6.825 Techniques in Artificial Intelligence
Resolution Theorem Proving:
Propositional Logic
Propositional resolution
Propositional theorem proving
Unification
Lecture 7 1
Today were going to talk about resolution, which is a proof strategy. First, well
6.825 Homework 3: Solutions
1
Easy EM
You are given the network structure shown in Figure 1 and the data in the following table, with
actual observed values for A, B, and C, and expected counts for D.
A
1
0
0
0
1
0
1
1
0
0
0
0
0
0
1
1
1
B
1
0
0
1
1
0
0
1
x
n i
r~rbjf
fhbfedbe)CXC`Ci~yuXev~tv|d5wtqCl)ml)Ckbzx
g c a Y u x q s v v w d u u q cfw_ t v s s u q x x q sy q
2
F
E
1
1
3
D
3
5
B
C
2
4
A
[email protected]`Ciouv
d q q x v v u q s t uu q x q s q
n&xC'Cxmqls1wkewjCiuyhfgeydvCys
6.891 Review Problems
5/16/01
1
Bayes Nets
I am a professor trying to predict the performance of my class on an exam.
After much thought, it is apparent that the students who do well are those
that studied and do not have a headache when they take the exa
6.825 Techniques in Artificial Intelligence
Planning
Planning vs problem solving
Situation calculus
Plan-space planning
Lecture 10 1
We are going to switch gears a little bit now. In the first section of the class, we
talked about problem solving, and
6.825 Techniques in Artificial Intelligence
Resolution Theorem Proving:
First Order Logic
Resolution with variables
Clausal form
Lecture 8 1
Weve been doing first-order logic and thinking about how to do proofs. Last time
we looked at how to do resolution
6.825 Techniques in Artificial Intelligence
Logic Miscellanea
Completeness and Incompleteness
Equality
Paramodulation
Lecture 9 1
Logic is a huge subject. It includes esoteric mathematical and philosophical
arguments as well as hard-core engineering of