New Semester
Started
Get
50% OFF
Study Help!
--h --m --s
Claim Now
Question Answers
Textbooks
Find textbooks, questions and answers
Oops, something went wrong!
Change your search query and then try again
S
Books
FREE
Study Help
Expert Questions
Accounting
General Management
Mathematics
Finance
Organizational Behaviour
Law
Physics
Operating System
Management Leadership
Sociology
Programming
Marketing
Database
Computer Network
Economics
Textbooks Solutions
Accounting
Managerial Accounting
Management Leadership
Cost Accounting
Statistics
Business Law
Corporate Finance
Finance
Economics
Auditing
Tutors
Online Tutors
Find a Tutor
Hire a Tutor
Become a Tutor
AI Tutor
AI Study Planner
NEW
Sell Books
Search
Search
Sign In
Register
study help
business
management and artificial intelligence
Paradigms Of Artificial Intelligence Programming Case Studies In Common Lisp 1st Edition Peter Norvig - Solutions
(Were you r e a l l y ? ) (Perhaps I already knew you were ?y)
(What other connections do you see?))(((?* ?x) I was (?* ?y))
( I n what way?) (What s i m i l a r i t i e s are there?))(((?* ?XI same (?* ?y))
(Could there r e a l l y be some connection?) (How?))(((?* ?XI a l i k e (?* ?y))
(What resemblance do you see?)
( I n what way i s it t h a t ?x i s l i k e ?y)
(What resemblance do you see between ?x and ?y))(((?* ?XI i s l i k e (?* ?y))
(Can you explain why you are suddenly ?y))(((?* ?XI I am sad (?* ?y))(I am sorry t o hear you are depressed)(I'm sure i t ' s not pleasant t o be sad))(((?* ?XI are l i k e (?* ?y))
(How have I helped you t o be ?y) (What makes you happy j u s t now)
(Why do you want ?y) (Suppose you got ?y soon))(((?* ?XI I am glad (?* ?y))
(What would it mean if you got ?y)
(What else comes t o mind when you t h i n k of your f a t h e r ? ) )(((?* ?XI I want (?* ?y))
(Your f a t h e r ) (Does he influence you strongly?)
(Who else i n your family ?y) ( T e l l me more about your f a m i l y ) )(((?* ?XI my father (?* ?y))
(Don't you believe that dream has t o do with your problem?))(((?* ?XI my mother (?* ?y))
(What persons appear i n your dreams?)
(What does t h i s dream suggest t o you?) (Do you dream often?)
(How do you feel about ?y i n r e a l i t y ? ) )(((?* ?XI dream (?* ?y))
(Have you dreamt ?y before?))(((?* ?XI dream about (?* ?y))
(What do you t h i n k about ?y) (Really-- i f ?y))(((?* ?XI I dreamt (?* ?y))(Really-- ?y) (Have you ever fantasized ?y while you were awake?)
(Do you r e a l l y t h i n k i t s l i k e l y that ?y) (Do you wish that ?y)
(What about ?y) (You mentioned ?y))(((?* ?XI i f (?* ?y))
(Why do you t h i n k I should r e c a l l ?y now)
(Did you t h i n k I would forget ?y ?)
(((?* ?XI do you remember (?* ?y))
(What i s the connection between me and ?y))
(What i n the present s i t u a t i o n reminds you o f ?y)
(What else do you remember) (Why do you r e c a l l ?y r i g h t now?)
(Does thinking of ?y bring anything else t o mind?)
(Do you often t h i n k of ?y)
(( (?* ?XI I remember (?* ?y)
(What feelings do you have when you apologize))
(Please don't apologize) (Apologies are not necessary)
(What do you think machines have t o do with your problem?))(((?* ?XI name (?* ?y))( I am n o t i n t e r e s t e d i n names))(((?* ?XI sorry (?* ?y))
(Why do you mention computers?)
(Do computers worry you?) (What do you t h i n k about machines?)
How do you do. Please state your problem.))(((?* ?XI computer (?* ?y))
1. Difficulty in capturing "deep" knowledge of the problem domain. MYCIN, for example, lacks any real knowledge of human physiology. It does not know what blood does or the function of the spinal cord. Folklore has it that once, when selecting a drug for treatment of meningitis, MYCIN asked whether
Exercise 5.18 [h] Read Weizenbaum's original article on ELIZA and transpose his list of rules into the notation used in this chapter.
Exercise 5.17 [m] The current version of ELIZA takes an input, transforms it according to the first applicable rule, and outputs the result. One can also imagine a system where the input might be transformed several times before the final output is printed. Would such a system be more powerful? If
Exercise 5.16 [s] Trick question: There is an object in Lisp which, when passed to va r i a b l e - p, results in an error. What is that object?
Exercise 5.15 [m] Give an informal proof that segment-match always terminates.
Exercise 5.14 [m] Define aversion of mappend that, like mapca r, accepts any number of argument lists.
Exercise 5.13 [m] Suppose that there is a call to segment - ma tc h where the variable already has a binding. The current definition will keep making recursive calls to segment -match, one for each possible matching position. But this is silly-if the variable is already bound, there is only one
Exercise 5.12 [m] Weigh the advantages of making pat -match return multiple values:the first would be true for a match and false for failure, and the second would be the binding list.
p Exercise 5.11 [m] Weigh the advantages of changing no - b i ndi ngs to n i 1, and fa i 1 to something else.
p Exercise 5.10 What is wrong with the following definition of s i mpl e - equa 1 ?(defun simple-equal (x y)"Test if two l i s t s or atoms are equal.";; Warning - incorrect(or (eql x y)(and (listp x) (listp y)(simple-equal ( f i r s t x) ( f i r s t y))(simple-equal (rest x) (rest y)) 1))
g Exercise 5.9 [h] Winston and Horn's book Lisp presents a good pattern-matching program. Compare their implementation with this one. One difference is that they handle the case where the first element of the pattern is a segment variable with the following code (translated into our notation):(or
g Exercise 5.8 [h] It turns out that none of the rules in the given script uses a variable more than once-there is no rule of the form ( ?x . . . ?x 1. Write a pattern matcher that only adds bindings, never checks variables against previous bindings. Use the ti me special form to compare your
p Exercise 5.7 [m] Add the "memory mechanism" discussed previously to ELIZA.Also add some way of definining synonyms like "everyone" and "everybody."
g Exercise 5.6 [rn] Modify ELIZA to have an explicit exit. Also arrange so that the output is not printed in parentheses either.
p Exercise 5.5 [h] Alter the input mechanism to handle commas and other punctuation characters. Also arrange so that the user doesn't have to type parentheses around the whole input expression. (Hint: this can only be done using some Lisp functions we have not seenyet. Lookat read-1 ine and
p Exercise 5.4 [s] We mentioned that our version of ELIZA cannot handle commas or double quote marks in the input. However, it seems to handle the apostrophe in both input and patterns. Explain.
Exercise 5.3 [h] Define a new set of rules that make ELIZA give stereotypical responses to some situation other than the doctor-patient relationship. Or, write a set of rules in a language other than English. Test and debug your new rule set.
Exercise 5.2 [m] Experiment with this version of ELIZA. Show some exchanges where it performs well, and some where it fails. Try to characterize the difference.Which failures could be fixed by changing the rule set, which by changing the p a t -match function (and the pattern language it defines),
. Debug and analyze the resulting program, and repeat the process
4. Test the program on representative examples
3. Implement the problem in a programming language
2. Specify the problem in algorithmic terms
1. Describe the problem in vague terms
Exercise 1.5 [m] Write a function to compute the dot product of two sequences of numbers, represented as lists. The dot product is computed by multiplying corresponding elements and then adding up the resulting products. Example:(dot-product '(10 20) '(3 4)) = 10 x 3 + 20 x4 = 110
Exercise 1.4 [m] Write a function that counts the number of times an expression occurs anywhere within another expression. Example: ( count - anywhere ' a ' ( a((a)b) a)) -. 3.
p Exercise 1.3 [m] Write a function that counts the number of atoms in an expression.For example: ( count - a toms ' ( a ( b ) c ) ) = 3. Notice that there is something of an ambiguity in this: should ( a n i 1 c ) count as three atoms, or as two, because it is equivalent to ( a ( 1 c ) ?
Exercise 1.1 [m] Define a version of 1 ast -name that handles "Rex Morgan MD,""Morton Downey, Jr.," and whatever other cases you can think of.p• Exercise 1.2 [m] Write a function to exponentiate, or raise a number to an integer power. For example: (power 3 2) = 32 = 9.
Will the problem solver always terminate, or can it become caught in an infinite looppg22
List and discuss two potentially negative effects on society of the development of artificial intelligence techniques.pg22
Add two more benefits for expert systems to those already listed in the text. Discuss these in terms of intellectual, social, or financial results.pg22
Pick one problem area that you feel would justify the energy required to design an expert system solution. Spell the problem out in some detail. Based on your own intuition, which aspects of this solution would be most difficult to automatepg22
Given the differences between the architectures of modern computers and that of the human brain, what relevance does research into the physiological structure and function of biological systems have for the engineering of AI programspg22 Justify your answer.pg22
Although computing is a relatively new discipline, philosophers and mathematicians have been thinking about the issues involved in automating problem solving for thousands of years. What is your opinion of the relevance of these philosophical issues to the design of a device for intelligent problem
Describe your own criteria for computer software to be considered "intelligent."pg22
Criticize Turing's criteria for computer software being "intelligent."pg22
Discuss your thoughts on the mind-body problem and its importance for a theory of artificial intelligence.
Much traditional Western thought has dwelt on the mind-body relationship. Are the mind and body:a. b. distinct entities somehow interacting, or is mind an expression of "physical processes," or C. is body just an illusion of the rational mindpg22
Give several other examples of Aristotle's distinction between "matter" and "form." Can you show how your examples might fit into a theory of abstractionpg22
Answers that are neither exact nor optimal, but are in some sense "sufficient." This is a result of the essential reliance on heuristic problem-solving methods in situations where optimal or exact results are either too expensive or not possible.pg22
An attempt to deal with issues of semantic meaning as well as syntactic form.pg22
Reasoning about the significant qualitative features of a situation.pg22
A concern with problem solving using inexact, missing, or poorly defined information and the use of representational formalisms that enable the programmer to compensate for these problems. pg22
A focus on problems that do not respond to algorithmic solutions. This underlies the reliance on heuristic search as an AI problem-solving technique.pg22
The use of computers to do symbolic reasoning, pattern recognition, learning, or some other form of inference.pg22
Little learning from experience. Current expert systems are handcrafted; once the system is completed, its performance will not improve without further attention from its programmers. This leads to severe doubts about the intelligence of such systems.pg22
Difficulties in verification. Though the correctness of any large computer system is difficult to prove, expert systems are particularly difficult to verify. This is a serious problem, as expert systems technology is being applied to critical applications such as air traffic control, nuclear
Inability to provide deep explanations. Because expert systems lack deep knowledge of their problem domains, their explanations are generally restricted to a description of the steps they took in finding a solution. They cannot tell "why" a certain approach was taken.pg22
Lack of robustness and flexibility. If humans are presented with a problem instance that they cannot solve immediately, they can generally return to an examination of first principles and come up with some strategy for attacking the problem. Expert systems generally lack this ability.pg22
Difficulty in capturing "deep" knowledge of the problem domain. MYCIN, for example, lacks any real knowledge of human physiology. It does not know what blood does or the function of the spinal cord. Folklore has it that once, when selecting a drug for treatment of meningitis, MYCIN asked whether
3.6 that allows complex sentences, such as, sentence sentence pg21pg21 sentence.
Add grammar rules to Example
3.6. pg21
Add rules for (multiple) prepositional phrases to Example
3.6. pg21
Add rules defining adjectives and adverbs to the grammar of Example
3.5 for the case of an individual with four dependents, $18,000 in the bank, and a steady income of $25,000 per year. Based on a comparison of this problem and the example in the text, suggest a generally "best" strategy for solving the problem. pg21
Trace a data-driven execution of the financial advisor of Example
Give another example of an and/or graph search problem and develop part of the search space. pg21
3.4 in a data-driven fashion. pg21
Trace the good-dog problem of Example
Write a backtrack algorithm for and/or graphs. pg21
pg21
Choose and justify a choice of breadth- or depth-first search for examples of Exercise
Showing 1900 - 2000
of 4756
First
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
Last
Step by Step Answers
Get 50% OFF
Claim Now
