All Matches

Solution Library

Expert Answer

Textbooks

Search Textbook questions, tutors and Books

Oops, something went wrong!

Change your search query and then try again

Result Not Found

Books FREE
Tutors
Study Help
Hire a Tutor
AI Study Help New

Search
Sign In
Register

study help
business
management and artificial intelligence

Questions and Answers of Management And Artificial Intelligence

We saw that planning graphs can handle only propositional actions. What if we want to use planning graphs for a problem with variables in the goal.,s uch as At (PIx, )A At (P2x, ), where x ranges
in STRIPS notation.Construct a plan for Shakey to get Boxz into Rooma.
The original STRIPS program was designed to control Shakey the robot. Figure 11.17 shows a version of Shakey's world consisting of four rooms lined up along a corridor, where each room has a door and
Prove the following assertions about planning graphs:m A literal that does not appear in the final level of the graph cannot be achieved.e The level cost of a literal in a serial graph is no greater
Construct levels 0, 1, and 2 of the planning graph for the problem in Figure 11.2.
Examine the definition of bidirectional search in Chapter 3.a. Would bidirectional state-space search be a good idea fior planning?b. What about bidirectional search in the space of partial-order
Let us consider how we might translate a set of STRIPS schemata into the successorstate axioms of situation calculus. (See Chapter 10.)a Consider the schema for Fly@, from, to). Write a logical
Given the axioms from Figure 11.2, what are all the applicable concrete instances of Fly(p, from, to) in the state described by At(Pl, JFK) A At(&, SFO) A Plane(Pl) A Plane(P2)A Airport(JFK) A
Recall that inheritance information in semantic networks can be captured logically by suitable implication sentences. In this exercise, we will consider the efficiency of using such sentences for
Make the necess,ary additions or changes to your knowledge base from the: previous exercise so that the questions that follow can be answered. Show that they can indeed be answered by the KB, and
(Adapted from an example by Doug Lenat.) Your mission is to capture, in logical form, enough knowledge to answer a series of questions about the following simple sentence:Yesterday John went to the
A complete solution to the problem of inexact matches to the buyer's description in shopping is very difficult and requires a full array of natural language processing and information retrieval
In this exercise, we will consider the problem of planning a route for a robot to take from one city to another. The basic action taken by the robot is Go(x, y), which takes it from city x to city y
Within situation calculus, write an axiom to associate tirne 0 with the situation So and another axiom to associate the time t with any situation that is derived from So by a sequence of t actions.
Here are two sentences in the language of first-order logic:(A):vx 39 (x 2 y)(B):jy vx (x 1 Y)a. Assume that the variables range over all the natural numbers O,1,2, . . . , m and that the">"
In this exercise, we will look at sorting in Prolog.a. Write Prolog clauses that define the predicate sorted (L ) , which is true if and only if list L is sorted in ascending order.b. Write a Prolog
The following Prollog code defines a predicate P:a. Showprooftreesandsolutionsforthequeries~(~[,1 ,2,3])a ndp(2, [1,~,3]).b. What standard list operation does P represent? P (X, [XY]). P(X, [YZ]) -
Trace the execution of the backward chaining algorithm in Figure 9.6 when it is applied to solve the crime problem. Show the sequence of values taken on by the goals variable, and arrange them into a
A popular childre11's riddle is "Brothers and sisters have I none, but that man's father is my father's son." Use the rules of the family domain (Chapter 8) to show who that man is.You may apply any
In this question we will use the sentences you wrote in Exercise 9.9 to answer a question using a backward-chaining algorithm.a. Draw the proof tree generated by an exhaustive backward-chaining
One might suppose that we can avoid the problem of variable conflict in unification during backward chaining by standardizing apart all of the sentences in the knowledge base once and for all. Show
Consider the subsumption lattices shown in Figure 9.2.a. Construct the lattice for the sentence Employs(Mother(John), Father(Richard)).b. Construct the lattice for the sentence Employs(IBM, y)
For each pair of atomic sentences, give the most general unifier if it exists:a. P(A,B ,B ),P (x,y ,2 ).b. Q(Y, G(A,B )),& (G(X4?1 Y) .c. Older(Father(y),y ), Older(Father(x),J ohn).d.
Suppose a knowledge base contains just one sentence, 3 x AsHzghAs (x, Everest).'Which of the following are legitimate results of applying Existential Instantiation?a. AsHzghAs(Everest, Everest).b.
From Likes (Jerry, Icecream) it seems reasonable to infer 3 x Likes (x, Ice Cream.).EINXTISRTOEDNUT,I~ATLI ON Write down a general inference rule, Existential Introduction, that sanctions this
Prove from first prjlnciples that Universal Instantiation is sound and that Existential Instantiation produces an inferentially equivalent knowledge base.
and the four-bit adder in Figure 8.6, and explain what queries you would use to verify the designs. What lunds of queries are not supported by this representation that (are supported by the
The circuit representation in the chapter is more detailed than necessary if we care only about circuit functionality. A simpler formulation describes any m-input, n-output gate or circuit using a
Explain what is wrong with the following proposed definition of adjacent squares in the wumpus world:Vx, y Adjacent([x, y], [x + 1, yl) A Adjacent([x, y], [x, y + 11) .
Explain what is wrong with the following proparsed definition of the set membership predicate E : Vx,s x = {x\s} {s h} = x h = x x
Is the sentence 3 z, y x = y valid? Explain.
Consider a knowledge base containing just two sentences: P(a) and P(b). Does this knowledge base entail 'v'x P(x)? Explain your answer in terms of models.
Trace the behavior of DPLL on the knowledge base in Figure 7.15 when trying to prove Q, and compare this behavior with that of the forward chaining algorithm.
Hotv long does it take to prove KB )= a using DIPLL when a is a literal already contained in KB? Explain.
Extend PL-WUMPUS-AGENsTo that it keeps track of all relevant facts within the knowledge base.
This exercise looks into the relationship between clauses and implication sentences.a. Show that the clause (7P1 V . . . V TP, V Q) is logically equivalent to the implication sentence (PI A . A P,) +
Minesweeper, the well-known computer game, is closely related to the wumpus world.A minesweeper world is a rectangular grid of N squares with M invisible mines scattered among them. Any square may be
1.a. Smoke =+ Smokeb. Smoke + Firee. (Smoke * Fire) + (?Smoke + +ire)d. Smoke V Fire V 7Firee. ((Smoke A Heat) + Fire) # ((Smoke + Fire) C' (Heat + Fire))f. (Smoke + Fire) =+ ((Smoke A Heat) +
Decide whether each of the following sentences is valid, unsatisfiable, or neither. Verify your decisions using truth tables or the equivalence rules of E4gure
Using a method of your choice, verify each of the: equi~ralencesin Figure 7.11.
Prove each of the following assertions:a. a is valid if and only if True a.b. For anya, False a.c. a + ,G' if and only if the sentence (a + P) is valid.d. a r p if and only if the sentence (a w P) is
Suppose the agent has progressed to the point shown in Figure 7.4(a), having perceived nothing in [1,1], a breeze in [2,1], and a stench in [1,2]. and is now concerned with the contents of [1,3],
Describe the wumpus world according to the properties of task environments listed in Chapter 2.
The minimax algorithm assumes that players take turns moving, but in card games such as whist and bridge, the winner of the previous trick plays first on the next trick.a. Modify the algorithm to
Implement the expectiminimax algorithm and the *-alpha-beta algorithm, which is described by Ballard (1983), for pruning game trees with chance nodes. Try them on a game such as backgammon and
Develop a formal proof of correctness for alpha-beta pruning. To do this, consider the situation shown in Figure 6.15. The question is whether to prune node nj, which is a maxnode and a descendant of
Implement move generators and evaluation functions for one or more of the following games: Kalah, Othello, checkers, and chess. Constnuct a general alpha-beta game-playing agent that uses your
This problem exercises the basic concepts of gamle playing, using tic-tac-toe (noughts and crosses) as an example. We define X, as the number of rows, columns, or diagonals with exactly n X's and no
Suppose that a graph is known to have a cycle cutset of 110 more than k nodes. Describe a simple algorithm for finding a minimal cycle cutset whose runtime is not much more than O(nk)fo r a CSP with
AC-3 puts back on the queue every arc (XI,, Xi)w henever any value is deleted from the domain of Xi, even if each value of XI, is consistent with several remaining values of Xi.Suppose that, for
Use the AC-3 algorithm to show that arc consistency is able to detect the inconsistency of the partial assignment { WA = red, V = blue) for the probllem shown in Figure 5.1.
Figure 5.5 tests out various algorithms on the n-queens problem. Try these same algorithms on map-coloring problems generated randomly as follows: scatter n points on the unit square; selecting a
Explain why it is a good heuristic to choose the variable that is most constrained, but the value that is least constraining in a CSP search.
How many solutions are there for the map-coloring problem in Figure 5. l?
Define in your own words the terms constraint satisfaction problem, constraint, backtracking search, arc consistency, backjumping and rnin-conflicts.
as an example.a. Repeat Exercise 3.16 using hill climbing. Does your agent ever get stuck in a local minimum? Is it possible for it to get stuck with convex obstacles?b. Construct a nonconvex
In this exercise, we will examine hill climbing in the context of robot navigation, using the environment in Figure
Generate a large number of 8-puzzle and 8-queens instances and solve them (where possible) by hill climbing (steepest-ascent and first-choice variants), hill climbing with random restart, and
Suppose that an agent is in a 3 x 3 maze environment like the one shown in Figure 4.18. The agent knows that its initial location is (1,1)1t,h at the goal is at (3,3),a nd that the four actions Up,
On page 108, we defined the relaxation of the &-puzzle in which a tile can move from square A to square B if B is blank. The exact solution of this problem defines Gaschnig's heuristic (Gaschnig,
We saw on page 96 that the straight-line distance heuristic leads greedy best-first search astray on the problem of going from Iasi to Fagaras. However, the heuristic is perfect on the opposite
The heuristic path algorithm is a best-first search in which the objective function is f(n) = (2 - w)g(n) + wh(n). For what values of w is this algorithm guaranteed to be optimal? (You may assume
Consider the vacuum-world problem defined in Figure 2.2.a. Which of the algorithms defined in this chapter would be appropriate for this problem?Should the algorithm check for repeated states?b.
On page 62, we said that we would not consider problems with negative path costs. In this exercise, we explore this in more depth.a. Suppose that actions can have arbitrarily large negative costs;
We can turn the navigation problem in Exercise 3.15 into an environment as follows:The percept will be a list of the positions, relative to the agent, of the visible vertices.The percept does not
Consider the problem of finding the shortest path between two points on a plane that has convex polygonal obstacles as shown in Figure 3.22. Ths is an idealization of the problem that a robot has to
Describe a state space in which iterative deepening search performs much worse than depth-first search (for example, O(n2) vs. O(n)).
Prove that uniform-cost search and breadth-first search with constant step costs are optimal when used with the GRAPH-SEARCH algorithm. Show a state space with varying step costs in which
On page 79, we mentioned iterative lengthening search, an iterative analog of uniform cost search. The idea is to use increasing limits on path cost. If a node is generated whose path cost exceeds
Implement two versions of the successor function for the 8-puzzle: one that generates all the successors at once by copying and editing the 8-puzzle data structure, and one that generates one new
Consider the n-queens problem using the "efficient" incremental formulation given on page 67. Explain why the state space size is at least $'% and estimate the largest n for which exhaustive
Show that the 8-puzzle states are divided into two disjoint sets, such that n'o state in one set can be transformed into a state in the other set by any number of moves. (~Yint: See Berlekamp et al.
Suppose that LEGAL-ACTIONS(~) denotes the set of actions that are legal in state s, and RESULT(^, s) denotes the state that results from performing a legal action a i~ns tate s.Define SUCCESSOR-FN in
Consider a modified version of the vacuum environment in Exercise 2.7, in which the agent is penalized one point for each movement.a. Can a simple reflex agent be perfectly rational for this
and specified on page 36. Your implementation should be modular, so that the sensors, actuators, and environment characteristics (size, shape, dirt placement, etc.) can be changed easily. (Note: for
Implement a performance-measuring environment simulator for the vacuum-cleaner world depicted in Figure
For each of the agent types listed in Exercise 2.5, characterize the environment according to the properties given in Section 2.3, and select a suitable agent design.1jfiEjE~p The following exercises
is indeed rational under the assumptions listed on page 36.b. Describe a rational agent function for the modified performance measure that deducts one point for each movement. Does the corresponding
Let us examine the rationality of various vacuum-cleaner agent functions.a. Show that the simple vacuum-cleaner agent function described in Figure
Some authors have claimed that perception and motor skills are the most important part of intelligence, and that '"higher level" capacities are necessarily parasitic-simple add-ons to these
Would you invest in blockchain led entertainment projects? Either way, give your reasons.
Will the Phoenix Waters combination of great stories, Asian star power and blockchain be a winning combination?
With NFTs, how could an audience get ‘agency’ in shows through decision-taking power in the stories?
With NFTs, how could a producer be paid all the way through the royalty lifespan of projects?
How could the technology open up payment opportunities for creators?
Find a use of AI in any other industry which could also be deployed in the media.
Identify a media company in your country which missed technology changes in the market, including AI. Consider its mistakes, and propose a recovery plan.
Are the ten future media business trends identified above the right ones? What different ones would you pick?
Which AI technologies are pivotal to implementation of the Metaverse?
Bearing in mind the dark side of social media after 2016 – disinformation, bad actors, hate speech, data breaches, content moderation failures – could similar risks affect the Metaverse? What
Put yourself in the position of CEO of a specific real-world games publisher. What is your Metaverse strategy?
Make the case for a surprising potential monetisation opportunity in the Metaverse that is not possible in the ‘real’ world.
You are briefing an Esports team on ways to exploit AI to (legitimately) improve performance. What will you propose?
How will Esports become a sustainable business model?
How can Riot Games make Esports viewing engaging for someone who doesn’t play League of Legends?
Which participant in the Esports value chain is most investable, and why? (Options include games, game developers, leagues, games publishers, players, live events, venues, accessories/hardware,
If you were Big Hit Entertainment how you would break the standard K-POP seven-year cycle, and stay relevant?
Where in the value creation process is the major driver in the K-POP business model as a whole – development, production, distribution or monetisation?
What is the business case for a major artist of Las Vegas residency versus a US tour?• Why are BTS successful?
Structure a digital marketing campaign for a Latin America tour by a French artist.

Showing 4400 - 4500 of 4588

First
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46

Services

Sitemap
Fun
Definitions
Become Tutor
Study Help Categories
Recent Questions
Expert Questions

Company Info

Security
Copyrights
Privacy Policy
Terms & Conditions
SolutionInn Fee
Scholarship

Get In Touch

About Us
Contact Us
Career
Jobs
FAQ
Campus Ambassador

Secure Payment

Download Our App

© 2024 SolutionInn. All Rights Reserved