Understanding Artificial Intelligence Fundamentals And Applications 1st Edition Oscar Ming Kin Law , Iain Law , Albert Chun-Chen Liu - Solutions

Discover the ultimate resource hub for "Understanding Artificial Intelligence Fundamentals And Applications 1st Edition" by Oscar Ming Kin Law, Iain Law, and Albert Chun-Chen Liu. Access a comprehensive online answers key, complete with a solution manual and solutions pdf, offering expertly solved problems and detailed questions and answers. Delve into our extensive test bank and chapter solutions, where step-by-step answers are meticulously crafted to guide your learning journey. Enhance your understanding with the instructor manual and textbook insights, all available for free download. Elevate your AI studies with our expertly curated resources!

Write a program that implements the fuzzy controller of Section 9.2.2.
Continue the inverted pendulum example of Section 9.2.2 with two more iterations of the controller where the output of one iteration is the input values for the next iteration.
Reasoning by assumption of a minimum model is important in human everyday life. Work out two more examples that assume minimum models.
Create another reasoning network similar to that of Figure 9.4 and show the dependency lattice for its premises, as was done in Figure 9.5.
Use the schema axioms presented in McCarthy (1980, Section 4) to create the circumscription results presented in Section 9.1.3.
Create a new example of diagnostic reasoning and use the Dempster–Shafer equations of Section 9.2.3 to obtain belief distributions as in Tables 9.1 and 9.2.
Consider the simple MYCIN-like rule: if A ∧ (B v C) ⇒ D (.9) ∧ E (.75). Discuss the issues that arise in capturing these uncertainties in a Bayesian context. How might this rule be handled in Dempster–Shafer reasoning?
Given the following rules in a “back-chaining” expert system application:A ∧ not(B) ⇒ C (.9)C v D ⇒ E (.75)F ⇒ A (.6)G ⇒ D (.8)The system can conclude the following facts (with confidences):F(.9)B(−.8)G(.7)Use the Stanford certainty factor algebra to determine E and its confidence.
Identify three application domains where reasoning under conditions of uncertainty is necessary. Pick one of these areas and design six inference rules reflecting reasoning in that domain.
Expand the propositional calculus representation scheme introduced by Williams and Nayak(1996a, p. 973) for describing state transitions for their propulsion system.
Read Williams and Nayak (1996, 1996a) for a more complete discussion of their modelbased planning system.
In Section 8.4.3 we presented a planner created by Nilsson and his students at Stanford(Benson and Nilsson 1995). Teleo-reactive planning allows actions described as durative, i.e., that must continue to be true across time periods. Why might teleo-reactive planning be preferred over a STRIPS-like
Read the ABSTRIPS research (Sacerdotti 1974) and show how it handles the linearity (or incompatible subgoal) problem in planning.
Show two more incompatible (precondition) subgoals in the blocks world operators of Figure 8.19.
Design an automated controller that could use add and delete lists to generate a graph search similar to that of Figure 8.19.
Use add and delete lists to generate the search space of Figure 8.19.
Show how the add and delete lists can be used to replace the frame axioms in the generation of STATE 2 from STATE 1 in Section 8.4.
Use the operators and frame axioms of the previous question to generate the search space of Figure 8.19.
Create the remaining frame axioms necessary for the four operators pickup, putdown, stack, and unstack described in rules 4 through 7 of Section 8.4.
Read and comment on the survey paper Improving Human Decision Making through Case-Based Decision Aiding by Janet Kolodner (1991).
If no software is available, consider building such a system in PROLOG, LISP, or Java.
Use commercial software (check the WWW) for building the case-based reasoning system of Exercise
Build a case-based reasoner for an application of your choice. One area might be for selecting computer science and engineering courses to complete an undergraduate major or a MS degree.
Read one of the early papers using model-based reasoning to teach children arithmetic(Brown and Burton 1978) or electronic skills (Brown and VanLehn 1980). Comment on this approach.
Read and comment on the paper Diagnosis based on description of structure and function(Davis et al., 1982).
Create a model-based reasoning system for a simple electronic device. Combine several small devices to make a larger system. You can use if... then... rules to characterize the system functionality.
What are its strengths and weaknesses? What would you do to improve it? Was it appropriate to your problem? What problems are best suited to that tool?
Critique the shell you used for Exercise
Implement an expert system using a commercial shell program. These are widely available for personal computers as well as larger machines. We especially recommend CLIPS from NASA (Giarratano and Riley 1989) or JESS from Sandia National Laboratories.
Pick another area of interest for designing an expert system. Answer Exercises 1–3 for this application.
Consider the graph of Exercise 2 above. Do you recommend data-driven or goal-driven search? breadth-first or depth-first search? In what ways could heuristics assist the search?Justify your answers to these questions.
Take Exercise 1 above. Create in English or pseudocode 15 if... then... rules (other than those prescribed in Section 8.2) to describe relations within this domain. Create a graph to represent the relationships among these 15 rules.
In Section 8.2 we introduced a set of rules for diagnosing automobile problems. Identify possible knowledge engineers, domain experts, and potential end users for such an application. Discuss the expectations, abilities, and needs of each of these groups.
Suppose you were designing an agent system to represent an American football or alternatively a soccer team. For agents to cooperate in a defensive or in a scoring maneuver, they must have some idea of each other’s plans and possible responses to situations. How might you build a model of another
There were a number of important issues presented near the end of Section 7.4 related to the creation of agent-oriented solutions to problems. Pick one of these and discuss the issue further.
Identify five properties that an agent language should have to provide an agent-oriented internet service. Comment on the role of Java as a general-purpose agent language fo building internet services. Do you see a similar role for CLOS? Why or why not? There is plenty of information on this topic
At the end of Section 7.3.1, there are five potential issues that Brooks’ subsumption architecture (1991a) must address to offer a successful general-purpose approach to problem-solving. Pick one or more of these and comment on it (them).
Brooks’ paper (1991a) offers an important discussion on the role of representation in traditional AI. Read this paper, and comment on the limitations of explicit, general-purpose representational schemes.
Describe a representation that could be used in a program to solve analogy problems like that in Figure 7.30. This class of problems was addressed by T. G. Evans (1968). The representation must be capable of representing the essential features of size, shape, and relative position.
Two examples of analogical reasoning were presented in Section 7.3. Describe an appropriate representation and search strategy that would allow for identification of the best answer in each situation. Create two more example analogies that would work with your proposed representation.a. hot is to
Each of the following sequences of characters is generated according to some general rule.Describe a representation that could be used to represent the rules or relationships required to continue each sequence:a. 2,4,6,8, . . .b. 1,2,4,8,16, . . .c. 1,1,2,3,5,8, . . .d. 1,a,2,c,3,f,4, . . .e.
Construct a type hierarchy in which some types do not have a common supertype. Add types to make this a lattice. Could this hierarchy be expressed using tree inheritance? What problems would arise in doing so?
Construct a hierarchy of subtypes for the concept vehicle; for example, subtypes of vehicle might be land_vehicle or ocean_vehicle. These would have further subtypes. Is this best represented as a tree, lattice, or general graph? Do the same for the concept move; for the concept angry.
Using conceptual dependencies, define a script for:a. A fast-food restaurant.b. Interacting with a used-car salesperson.c. Going to the opera.
Give evidence from your own experience that suggests a script-like or frame-like organization of human memory.
Translate the financial advisor knowledge base, Section 2.4, into conceptual graph form.
Translate the conceptual graphs of Figure 7.29 into predicate calculus.
Define a specialized representation language to describe the activities of a public library.This language will be a set of concepts and relations using conceptual graphs. Do the same thing for a retail business. What concepts and relations would these two languages have in common? Which would exist
Specialization of conceptual graphs using join and restrict is not a truth-preserving operation. Give an example that demonstrates that the restriction of a true graph is not necessarily true. However, the generalization of a true graph is always true; prove this.
The operations join and restrict define a generalization ordering on conceptual graphs. Show that the generalization relation is transitive.
Translate the conceptual graphs of Figure 7.29 into English sentences.
Read “What’s in a Link” by Woods (1985). Section IV of this article lists a number of problems in knowledge representation. Suggest a solution to each of these problems using logic, conceptual graphs, and frame notations.
In Section 7.2.1 we presented some of the arguments against the use of logic for representing common sense knowledge. Make an argument for the use of logic in representing this knowledge.
Section 6.2.3 presented the general conflict resolution strategies of refraction, recency, and specificity. Propose and justify two more such strategies.
Using predicate calculus as a representation language:a. Write the problem explicitly as a production system.b. Generate the state space and stages of working memory for the data-driven solution to the example in Chapter 3.c. Repeat b for a goal-driven solution.
Consider the financial advisor problem discussed in Chapters 2, 3, and
Using the goal and start states of Figure 6.5, hand run the production system solution to the 8-puzzle:a. In goal-driven fashion.b. In data-driven fashion.
Using the rule in Example 6.2.3 as a model, write the eight move rules needed for the full 8× 8 version of the knight’s tour.
Write the pseudo-code definition for a breadth-first version of pattern_search (Section 6.1.2). Discuss the time and space efficiency of this algorithm.
Using the move and path definitions for the knight’s tour of Section 6.1.2, trace the execution of pattern_search on the goals:a. path(1,9).b. path(1,5).c. path(7,6).When the move predicates are attempted in order, there is often looping in the search.Discuss loop detection and backtracking in
Trace the execution of the recursive depth-first search algorithm (the version that does not use an open list) on the state space of Figure 3.14.
a. Write a member-check algorithm to recursively determine whether a given element is a member of a list.b. Write an algorithm to count the number of elements in a list.c. Write an algorithm to count the number of atoms in a list.(The distinction between atoms and elements is that an element may
Three prisoners, A, B, C, are in their cells. They are told that one of them will be executed the next day and the others will be pardoned. Only the governor knows who will be executed.Prisoner A asks the guard a favor. “Please ask the governor who will be executed, and then tell either prisoner
Suppose an automobile insurance company classifies a driver as good, average, or bad. Of all their insured drivers, 25% are classified good, 50% are average, and 25% are bad.Suppose for the coming year, a good driver has a 5% chance of having an accident, and an average driver has 15% chance of
The expectation is the mean or average of the value of a random variable. In throwing a die, for example, it can be calculated by totaling up the resulting values from a large number of throws and then dividing by the number of throws. What is:a. the expectation from throwing a fair die?b. the
a. Create an algorithm for heuristically searching and/or graphs. Note that all descendants of an and node must be solved to solve the parent. Thus, in computing heuristic estimates of costs to a goal, the estimate of the cost to solve an and node must be at least the sum of the estimates to solve
Perform alpha-beta pruning on the tic-tac-toe search of Figures 4.23, 4.24, and 4.25. How many leaf nodes can be eliminated in each case?
Perform a right-to-left prune on the same tree. Discuss why a different pruning occurs.
Perform a left-to-right alpha-beta prune on the tree of Exercise
Perform minimax on the tree shown in Figure 4.30.
Prove that more informed heuristics develop the same or less of the search space. Hint:formalize the argument presented in Section 4.3.3.
Prove A* is admissible. Hint: the proof should show that:a. A* search will terminate.b. During its execution there is always a node on open that lies on an optimal path to the goal.c. If there is a path to a goal, A* will terminate by finding the optimal path.
Compare the three 8-puzzle heuristics of Figure 4.14 with the heuristic of adding the sum of distances out of place to 2 times the number of direct reversals. Compare them in terms of:a. Accuracy in estimating distance to a goal. This requires that you first derive the shortest path solution and
A tile can hop over one or two other tiles into the empty position. This has a cost equal to the number of tiles jumped over.The goal is to have all the white tiles to the left of all the black tiles. The position of the blank is not important.a. Analyze the state space with respect to complexity
The sliding-tile puzzle consists of three black tiles, three white tiles, and an empty space in the configuration shown in Figure 4.29.The puzzle has two legal moves with associated costs:A tile may move into an adjacent empty location. This has a cost of
Use the backward component of the dynamic programing algorithm to find another optimal alignment of the characters of Figure 4.6. How many optimal alignments are there?
Extend the the “most wins” heuristic for tic-tac-toe two plys deeper in the search space of Figure 4.3. What is the total number of states examined using this heuristic? Would the traditional hill-climbing algorithm work in this situation? Why?
Add grammar rules to the English grammar of Example 3.3.6 that allow complex sentences such as, sentence ↔ sentence AND sentence.
Add rules for (multiple) prepositional phrases to the English grammar of Example 3.3.6.
Add rules for adjectives and adverbs to the English grammar of Example 3.3.6.
Trace a data-driven execution of the financial advisor of Example 3.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
Trace the goal-driven good-dog problem of Example 3.3.4 in a data-driven fashion.
Choose and justify a choice of breadth- or depth-first search for examples of Exercise 6.
“Hand run” the backtrack algorithm on the graph in Figure 3.29. Begin from state A. Keep track of the successive values of NSL, SL, CS, etc.
Build a finite state acceptor that recognizes all strings of binary digitsa) that contain “111”,b) that end in “111”,c) that contain “111” but not more that three consecutive “1”s.
Give the graph representation for the farmer, wolf, goat, and cabbage problem of Section 15.3 (see Figures 15.1 and 15.2). Let the nodes represent states of the world; e.g., the farmer and the goat are on the west bank and the wolf and cabbage on the east. Discuss the advantages of breadth-first
Give two alternative interpretations for the blocks world description of Figure 2.3.
Implement the unify algorithm of Section 2.3.2 in the computer language of your choice.
a. Prove that modus ponens is sound for propositional calculus. Hint: use truth tables to enumerate all possible interpretations.b. Abduction is an inference rule that infers P from P → Q and Q. Show that abduction is not sound (see Chapter 8).c. Show modus tollens ((P → Q) ∧ ¬ Q) → ¬ P
Using truth tables, prove the identities of Section 2.1.2.
List and discuss two potentially negative effects on society of the development of artificial intelligence techniques.
Much traditional Western thought has dwelt on the mind–body relationship. Are the mind and body:a. distinct entities somehow interacting, orb. is mind an expression of “physical processes”, orc. is body just an illusion of the rational mind?Discuss your thoughts on the mind–body problem and
Will Edge AI sever replace cloud one in future?
What are the key features of the Kneron NPU?
Why are Edge AI systems necessary for deep learning applications?
Why are the Brain Floating Point Format better than IEEE Floating Point Format?
How does Google systolic array speed up the matrix multiplication?
What is the major drawback of Nvidia GPU?
Why is Nvidia “GPU” widely used for neural network training?
How does Intel CPU overcome the massively parallel processing challenges?

Showing 1300 - 1400 of 4756

First
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
Last

Understanding Artificial Intelligence Fundamentals And Applications 1st Edition Oscar Ming Kin Law , Iain Law , Albert Chun-Chen Liu - Solutions

Step by Step Answers