• Home
  • Textbooks
  • Artificial Intelligence. A Modern Approach [Global Edition]
  • Knowledge in Learning

Artificial Intelligence. A Modern Approach [Global Edition]

Stuart Russell, Peter Norvig

Chapter 19

Knowledge in Learning - all with Video Answers

Educators

Chapter Questions

Problem 1

Show, by translating into conjunctive normal form and applying resolution, that th conclusion drawn on page 784 concerning Brazilians is sound.

Check back soon!
00:38

Problem 2

For each of the following determinations, write down the logical representation an explain why the determination is true (if it is):
a. Zip code determines the state (U.S.).
b. Design and denomination determine the mass of a coin.
c. Climate, food intake, exercise, and metabolism determine weight gain and loss.
d. Baldness is determined by the baldness (or lack thereof) of one's maternal grandfather

Lourence Gonhovi
Lourence Gonhovi
Numerade Educator

Problem 3

Would a probabilistic version of determinations be useful? Suggest a definition.

Check back soon!
01:32

Problem 4

Fill in the missing values for the clauses $C_1$ or $C_2$ (or both) in the following sets o clauses, given that $C$ is the resolvent of $C_1$ and $C_2$ :
a. $C=$ True $\Rightarrow P(A, B), C_1=P(x, y) \Rightarrow Q(x, y), C_2=$ ??.
b. $C=$ True $\Rightarrow P(A, B), C_1=$ ??, $C_2=$ ??.
c. $C=P(x, y) \Rightarrow P(x, f(y)), C_1=? ?, C_2=$ ??.

If there is more than one possible solution, provide one example of each different kind.

Teresa Fuston
Teresa Fuston
Numerade Educator

Problem 5

Suppose one writes a logic program that carries out a resolution inference step. Tha is, let Resolve $\left(c_1, c_2, c\right)$ succeed if $c$ is the result of resolving $c_1$ and $c_2$. Normally, Resolv would be used as part of a theorem prover by calling it with $c_1$ and $c_2$ instantiated to par ticular clauses, thereby generating the resolvent $c$. Now suppose instead that we call it witl $c$ instantiated and $c_1$ and $c_2$ uninstantiated. Will this succeed in generating the appropriat results of an inverse resolution step? Would you need any special modifications to the logi programming system for this to work?

Check back soon!

Problem 6

Suppose that FOIL is considering adding a literal to a clause using a binary predicat $P$ and that previous literals (including the head of the clause) contain five different variables
a. How many functionally different literals can be generated? Two literals are functionally identical if they differ only in the names of the new variables that they contain.
b. Can you find a general formula for the number of different literals with a predicate o arity $r$ when there are $n$ variables previously used?
c. Why does ForL not allow literals that contain no previously used variables?

Check back soon!