Artificial Intelligence: A Modern Approach
3rd Edition
ISBN: 9780136042594
Author: Stuart Russell, Peter Norvig
Publisher: Prentice Hall
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 6, Problem 11E
Explanation of Solution
Tracing through each iteration of the while loop in AC-3:
a. Remove SA−WA, delete G from SA.
b. Remove SA−V , delete R from SA, leaving only B.
c. Remove NT −WA, delete G from NT.
d. Remove NT −SA, delete B from NT, leaving only R...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Given: NFA M1 = ({A,B,C}, {a,b}, delta, A, {C})
where delta:
(A,a) -> {A}, (A,b) -> {A,B},
(B,a) -> {C}, (B,b) -> null,
(C,a) -> null, (C,b) -> null.
Get the equivalent DFA of the given NFA.
Given: NFA M1 = ({A,B,C}, {a,b}, delta, A, {C})
where delta:
(A,a) -> {A}, (A,b) -> {A,B},
(B,a) -> {C}, (B,b) -> null,
(C,a) -> null, (C,b) -> null.
Get the equivalent DFA of the given NFA.
How many self-loop edge/s in the equivalent DFA?
You must find six three-letter words: three words read across (1-across, 4-across, 5-across) and three words read down (1-down, 2-down, 3-down). Each word must be chosen from the list of 18 possible words shown. Try to solve it yourself, first by intuition, then by hand using first domain consistency and then arc consistency.
Can be represented 2 ways:
The first is to represent the word positions (1-across, 4-across, etc.) as variables, with the set of words as possible values. The constraints are that the letter is the same where the words intersect.
The second is to represent the nine squares as variables. The domain of each variable is the set of letters of the alphabet, {a,b,…,z}{a,b,…,z}. The constraints are that there is a word in the word list that contains the corresponding letters. For example, the top-left square and the center-top square cannot both have the value aa, because there is no word starting with aaaa.
(a)
Give an example of pruning due to domain…
Chapter 6 Solutions
Artificial Intelligence: A Modern Approach
Knowledge Booster
Similar questions
- Given: NFA M1 = ({A,B,C}, {a,b}, delta, A, {C}) where delta: (A,a) -> {A}, (A,b) -> {A,B}, (B,a) -> {C}, (B,b) -> null, (C,a) -> null, (C,b) -> null. Get the equivalent DFA of the given NFA. What is the next state for input pair (C,a) in the equivalent DFA? Choices A B C Darrow_forwardThe set of letters S consists of 30 As, 6 Bs, 24 Cs, 15 Ds, and 15 Es. The set of letters T consists of 25 As, 20 Bs, 15 Cs, 5 Ds and 35 Es. What is the mutual index of coincidence between sets S and T? Leave your answer as a fraction in lowest termsarrow_forwardGive conditions under which the following expressions are equivalent:A,Bγagg(C)(E1 ⋈ E2) and (Aγagg(C)(E1)) ⋈ E2where agg denotes any aggregation operation. How can the above conditionsbe relaxed if agg is one of min or max?arrow_forward
- What does it mean to say a set of wffs Γ is p-consistent (and p-inconsistent)?arrow_forwardQuestion 18 In the recurrence relation f(n)=af(n/b)+g(n), the number of subproblems is a. True O Falsearrow_forwardIf L=xyzy where x,y,z e (0,1)*, then L is CFL or regular? Explain with proper justification.arrow_forward
- Question 4: Consider two recurrence relations P(n) = 2P(n/2) +n and Q(n) = 4Q (n/4) +2n. What is the relationship between P and Q? Is P = O(Q), P = N(Q), or P = O(Q)? Prove your answer using limit of ratio definition of asymptotic notations.arrow_forwardWhat is the general solution for the recurrence relation t (1) tn = c1(3)” +c2(-7)” (2) tn = c1(−3) +c2(7)” (3) tn = c1(3)” +c2(7)n (4) tn = c1(–3)”+c2(-7)” A B Choice (4) Choice (1) C) Choice (3) (D) Choice (2) = -10tn-1-21tn-2 ?arrow_forwardDefine a recurrence relation T(n) that corresponds to the natural numbers, but that "skips" multiples of 3. That is, T(1) = 1, T(2) = 2, T(3) = 4, T(4) = 5, T(5) = 7, T(6) = 8, T(7) = 10, ... Your answer should only have some number of base cases and the general case, but no conditions (like "if n mod3=0").arrow_forward
- Use the substitution method to identify the big-Oh of the represented by the following recurrence relation. Note: c is a constant. T(n) = cn + T(n/2) + T(n/2), T(1) = carrow_forwardUse domain splitting with Arc Consistency (AC) to solve the problem. Draw the search treeand at each node show the domain of each variable after AC is applied.arrow_forwardGiven: e-NFA M2 = ({A,B,C}, {0,1}, delta, A, {C}) where delta: (A,0) -> {C}, (A,1) -> {B}, (A,e) -> null, (B,0) -> {A}, (B,1) -> null, (B,e) -> {C}, (C,0) -> null, (C,1) -> {A}, (C,e) -> null Get the equivalent DFA of the given e-NFA. How many 3-symbol strings are accepted in the given e-NFA M2 or in the equivalent DFA?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education