DOCX

# Ch-18

By Billy Griffin,2015-03-27 07:18
6 views 0
Ch-18

CHAPTER 18

Artificial Intelligence

(Solutions to Odd-Numbered Problems)

Review Questions

1. An interrogator asks a set of questions that are forwarded to a computer and a

human being. The interrogator receives two sets of responses: one from the com-

puter and one from the human. After careful examination of the two sets, if the

interrogator cannot definitely tell which set has come from the computer, the com-

puter has passed the intelligent test. Some experts think that this is an accurate def-

inition of an intelligent system; some think that the test is not necessarily the

definition of an intelligent system.

3. LISP is a programming language that manipulates lists. LISP treats data, as well as

a program, as a list,. This means a LISP program can change itself. This feature

matches with the idea of an intelligent agent that can learn from the environment

and improves its behavior. PROLOG is a language that can build a database of

facts and a knowledge base of rules. A program in PROLOG can use logical rea-

soning to answer questions that can be inferred from the knowledge base.

5. Propositional logic is a language made of a set of sentences that can be used to do

logical reasoning about the world. In propositional logic, a symbol that represents

a sentence is atomic; it cannot be broken to find some information about its com-

ponents. To do so, we need predicate logic, the logic that defines the relation

between the parts in a proposition.

7. A ruled-based system represents knowledge using a set of rules that can be used to

deduce some new facts from already-known facts. The semantic network is a

graphical representation of entities and their relationships.

9. The five stages of image processing are edge detection, segmentation, finding

depth, finding orientation, and object recognition.

11. Neural networks try to simulate the learning process of the human brain using a

networks of artificial neurons.

1

SECTION 2

Multiple-Choice Questions

13. d 15. c 17. d 19. b 21. c 23. a 25. c

Exercises

27. The set of frames are shown in Figure S18.27. Figure S18.27 Exercise 27

Career Medical Doctor Superclass Superclass Accountant Internist Career Medical Doctor Superclass Superclass Engineer Gynocologist Career Medical Doctor Superclass Superclass Medcial Doctor Family Practitioner

Family Practitioner French Instance of Is Dr. Pascal

29.

a. It is not hot.

b. It is warm or it is hot.

c. It is warm and hot.

d. It is warm but it is not hot.

e. It is not true that it is warm and hot.

f. If it is warm, then it is hot.

g. If it is not cold, then it is warm.

h. It is not true that if is not warm, then it is hot.

i. It is hot if it is not warm.

j. It is not cold and hot, or it is cold and not hot.

；(，；

a.；;x [Cat (x)；; Has；？John, x，，；

b.；；x [Cat (x)；; Loves；？John, x，，；

c. Loves；？John Anne，；

d.；;x [Dog (x)；？ Loves；？Anne x，，；

e.；;x [~ Cat (x)；？ Loves；？John x，，

SECTION 3

f.；;x [ Cat (x)；？；~ Loves；？Anne x，，；

g.；;x {[ Cat (x)；？；~ Loves；？John x，，；; Loves；？Anne x，；；

h.；;x {[ Cat (x)；？；~ Loves；？John x，，；; Loves；？Anne x，；；

i.

；；，；

a.；~ Identical (John, Anne，；

b.；;x [John (x)，；

c.；~;x [Anne (x)，；

d.；;x

e.；~;x

f.；;x;y [~ Identical (x, y，，；

35. The truth table is shown below. The argument {P；？ Q, P}；：; Q is not valid:

P Q P P；? Q F F F F

F T T F Counterexample T F T T OK T T T T Premise Premise Conclusion

37. The truth table is shown below. The argument {P；; Q, Q；; R}；：; (P；; R) is not

valid

P Q R P; Q Q; R P; R OK F F F T T OK F F T T T Counterexample F T F T F OK F T T T T T F F F T T F T F T

T T F T F OK T T T T T Premise Premise Conclusion

39. The design of neural network, with weights w1 = w2 = 0.5 and the threshold of T =

1, is shown in Figure S18.39.

Figure S18.39 Exercise 39

x1 . w2

Output y (0 or 1) Inputs

x2 . w4 T = 1 w1 = w2 = 0.5

SECTION 4

The truth table for this neural network is shown below. It is the same as the truth

table for an AND gate.

Inputs Compare S with T Output S = x1；， w1 + x2；， w2 0 0 0 S < T 0 0 1 0.5 S < T 0

1 0 0.5 S < T 0 1 1 1 S = T 1

41. Figure S18.41 shows the breadth-first search for the tree diagram.

Figure S18.41 Exercise 41

A

B C D E F G H I J L K

43. Figure S18.43 shows the tree diagram for the maze.

Figure S18.43 Exercise 43

Start A

B C

E D

F G H I J K L M O N

P Q

Finish

SECTION 5

45. Figure S18.45 shows the depth-first search for Exercise 43.

Figure S18.45 Exercise 45

Start

A

B C

E D

F G H

I J K L M O N P Q

Finish

Report this document

For any questions or suggestions please email
cust-service@docsford.com