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
Toggle navigation
FREE Trial
S
Books
FREE
Tutors
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
Ask a Question
Search
Search
Sign In
Register
study help
computer science
artificial intelligence modern
Questions and Answers of
Artificial Intelligence Modern
Consider the following sentence:[(Food ⇒ Party) ∨ (Drinks ⇒ Party)] ⇒ [(Food ∧ Drinks) ⇒ Party] .a. Determine, using enumeration, whether this sentence is valid, satisfiable (but not
A sentence is in disjunctive normal form (DNF) if it is the disjunction of conjunctions NORMAL FORM of literals. For example, the sentence (A ∧ B ∧ ¬C) ∨ (¬A ∧ C) ∨ (B ∧¬C) is in
Convert the following set of sentences to clausal form.S1: A ⇔ (B ∨ E).S2: E ⇒ D.S3: C ∧ F ⇒ ¬B.S4: E ⇒ B.S5: B ⇒ F.S6: B ⇒ CGive a trace of the execution of DPLL on the conjunction
Is a randomly generated 4-CNF sentence with n symbols and m clauses more or less likely to be solvable than a randomly generated 3-CNF sentence with n symbols and m clauses? Explain.
Trace the behavior of DPLL on the knowledge base in Figure 7.16 when trying to prove Q, and compare this behavior with that of the forward-chaining algorithm.Figure 7.16 LAM = P P ВЛL 3D M ΑΛΡ L
Write a successor-state axiom for the Locked predicate, which applies to doors, assuming the only actions available are Lock and Unlock.
Section 7.7.1 provides some of the successor-state axioms required for the wumpus world. Write down axioms for all remaining fluent symbols.
Modify the HYBRID-WUMPUS-AGENT to use the 1-CNF logical state estimation method described on page 271. We noted on that page that such an agent will not be able to acquire, maintain, and use more
Which of the following are valid (necessarily true) sentences?a. (∃x x = x) ⇒ (∀ y ∃z y = z).b. ∀x P(x) ∨¬P(x).c. ∀ x Smart(x) ∨ (x = x).
Are reflex actions (such as flinching from a hot stove) rational? Are they intelligent?
The neural structure of the sea slug Aplysia has been widely studied (first by Nobel Laureate Eric Kandel) because it has only about 20,000 neurons, most of them large and easily manipulated.
To what extent are the following computer systems instances of artificial intelligence:• Supermarket bar code scanners.• Web search engines.• Voice-activated telephone menus.• Internet
Many of the computational models of cognitive activities that have been proposed involve quite complex mathematical operations, such as convolving an image with a Gaussian or finding a minimum of the
Is AI a science, or is it engineering? Or neither or both? Explain.
“Surely animals cannot be intelligent—they can do only what their genes tell them.” Is the latter statement true, and does it imply the former?
Examine the AI literature to discover whether the following tasks can currently be solved by computers:a. Playing a decent game of table tennis (Ping-Pong).b. Driving in the center of Cairo, Egypt.c.
Various subfields of AI have held contests by defining a standard task and inviting researchers to do their best. Examples include the DARPA Grand Challenge for robotic cars, The International
Suppose that the performance measure is concerned with just the first T time steps of the environment and ignores everything thereafter. Show that a rational agent’s action may depend not just on
Let us examine the rationality of various vacuum-cleaner agent functions.a. Show that the simple vacuum-cleaner agent function described in Figure 2.3 is indeed rational under the assumptions listed
For each of the following assertions, say whether it is true or false and support your answer with examples or counterexamples where appropriate.a. An agent that senses only partial information about
This exercise explores the differences between agent functions and agent programs.a. Can there be more than one agent program that implements a given agent function? Give an example, or show why one
Write pseudocode agent programs for the goal-based and utility-based agents. The following exercises all concern the implementation of environments and agents for the vacuum-cleaner world.
Your goal is to navigate a robot out of a maze. The robot starts in the center of the maze facing north. You can turn the robot to face north, east, south, or west. You can direct the robot to move
Suppose two friends live in different cities on a map, such as the Romania map shown in Figure 3.2. On every turn, we can simultaneously move each friend to a neighboring city on the map. The amount
Consider the n-queens problem using the “efficient” incremental formulation given on page 72. Explain why the state space has at least 3√n! states and estimate the largest n for which
Give a complete problem formulation for each of the following. Choose a formulation that is precise enough to be implemented.a. Using only four colors, you have to color a planar map in such a way
On page 68, we said that we would not consider problems with negative path costs. In this exercise, we explore this decision in more depth.a. Suppose that actions can have arbitrarily large negative
Consider the problem of finding the shortest path between two points on a plane that has convex polygonal obstacles as shown in Figure 3.31. This is an idealization of the problem that a robot has to
The missionaries and cannibals problem is usually stated as follows. Three missionaries and three cannibals are on one side of a river, along with a boat that can hold one or two people. Find a way
Define in your own words the following terms: state, state space, search tree, search node, goal, action, transition model, and branching factor.
What’s the difference between a world state, a state description, and a search node? Why is this distinction useful?
An action such as Go(Sibiu) really consists of a long sequence of finer-grained actions: turn on the car, release the brake, accelerate forward, etc. Having composite actions of this kind reduces the
Which of the following are true and which are false? Explain your answers. a. Depth-first search always expands at least as many nodes as A∗ search with an admissible heuristic.b. h(n) = 0 is
Prove that GRAPH-SEARCH satisfies the graph separation property illustrated in Figure 3.9. Begin by showing that the property holds at the start, then show that if it holds before an iteration of the
Consider a state space where the start state is number 1 and each state k has two successors: numbers 2k and 2k + 1.a. Draw the portion of the state space for states 1 to 15.b. Suppose the goal state
A basic wooden railway set contains the pieces shown in Figure 3.32. The task is to connect these pieces into a railway that has no overlapping tracks and no loose ends where a train could run off
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 the current
Prove each of the following statements, or give a counter example:a. Breadth-first search is a special case of uniform-cost search.b. Depth-first search is a special case of best-first tree search.c.
Trace the operation of A∗ search applied to the problem of getting to Bucharest from Lugoj using the straight-line distance heuristic. That is, show the sequence of nodes that the algorithm will
The heuristic path algorithm (Pohl, HEURISTIC PATH 1977) is a best-first search in which the evaluation function is f(n) = (2 − w)g(n) + wh(n). For what values of w is this complete? For what
Consider the unbounded version of the regular 2D grid shown in Figure 3.9. The start state is at the origin, (0,0), and the goal state is at (x, y).a. What is the branching factor b in this state
n vehicles occupy squares (1, 1) through (n, 1) (i.e., the bottom row) of an n × n grid. The vehicles must be moved to the top row but in reverse order; so the vehicle i that starts in (i, 1) must
The traveling salesperson problem (TSP) can be solved with the minimum-spanning tree (MST) heuristic, which estimates the cost of completing a tour, given that a partial tour has already been
The AND-OR-GRAPH-SEARCH algorithm in Figure 4.11 checks for repeated states only on the path from the root to the current state. Suppose that, in addition, the algorithm were to store every visited
Explain precisely how to modify the AND-OR-GRAPH-SEARCH algorithm to generate a cyclic plan if no acyclic plan exists. You will need to deal with three issues: labeling the plan steps so that a
In Section 4.4.1 we introduced belief states to solve sensorless search problems. A sequence of actions solves a sensorless problem if it maps every physical state in the initial belief state b to a
This exercise explores subset–superset relations between belief states in sensor less or partially observable environments.a. Prove that if an action sequence is a solution for a belief state b, it
It was assumed that a given action would have the same cost when executed in any physical state within a given belief state. (This leads to a belief-state search problem with well-defined step
Consider the sensorless version of the erratic vacuum world. Draw the belief-state space reachable from the initial belief state {1, 2, 3, 4, 5, 6, 7, 8}, and explain why the problem is unsolvable.
Like DFS, online DFS is incomplete for reversible state spaces with infinite paths. For example, suppose that states are points on the infinite two-dimensional grid and actions are unit vectors (1,
Showing 100 - 200
of 150
1
2