Suppose you have a relation v(N, W) that is true if there is a vowel (one o:
Question:
Suppose you have a relation v(N, W) that is true if there is a vowel
(one o:
a, e, i, o, u) as the N-th letter of word W. For example, v(2, cat) is true because there is a vowel (“a”) as the second letter of the word “cat”; v(3, cat) is false because the third letter of “cat” is “t”, which is not a vowel; and v(5, cat) is also false because there is no fifth letter in “cat”.
Suppose the domain of N is {1, 3, 5} and the domain of W is {added, blue, fever, green, stare}.
(a) Is the arc N, v arc consistent? If so, explain why. If not, show what element(s) can be removed from a domain to make it arc consistent.
(b) Is the arc W, v arc consistent? If so, explain why. If not, show what element(s) can be removed from a domain to make it arc consistent.
Step by Step Answer:
Artificial Intelligence: Foundations Of Computational Agents
ISBN: 9781009258197
3rd Edition
Authors: David L. Poole , Alan K. Mackworth