A solution to a CSP is:
A) An assignment of values to some of the variables, satisfying some of the
constraints
B) An assignment of values to all of the variables, satisfying none of the
constraints
C) An assignment of values to all of the variables, satisfying all of the constraints
D) An assignment of values to some of the variables, satisfying all of the
constraints Ans✓✓✓ C
Arc-consistency always detects an unsolvable CSP.
A) True
B) False Ans✓✓✓ B
Arc-consistency always finds a solution to a CSP (if one exists).
A) True
B) False Ans✓✓✓ B
Assume A ≻ B, B ≻ L, where L = [0.5,C; 0.5,D], and D ≻ A.
Assuming rational preferences, which of the following statements are guaranteed
to be true?
, A) A ≻ L
B) A ≻ C
C) A ≻ D
D) B ≻ C
E) B ≻ D Ans✓✓✓ A B D
Both the max and the min of multiple admissible heuristics are admissible. Which
of the following statements is true?
A)The max of multiple admissible heuristics dominates the min of the same
heuristics
B) The min of multiple admissible heuristics dominates the max of the same
heuristics Ans✓✓✓ A
Check each of the following that are components of a CSP model.
A) Variables
B) Domains
C) Constraints Ans✓✓✓ A B C
Consider a lottery L = [0.2,A; 0.3,B; 0.4,C; 0.1,D], where the utility values of each
of the outcomes are U(A)=1, U(B)=3, U(C)=5, U(D)=2.
What is the utility of this lottery, U(L)? Ans✓✓✓ 3.3
Consider a lottery L1 = [0.5,A; 0.5,L2], where U(A)=4, and L2 = [0.5,X; 0.5Y] is a
lottery, and U(X)=4, U(Y)=8.