(Solved): Consider the following predicate logic program, in which \( P \) and \( Q \) are unary predicate sy ...

Consider the following predicate logic program, in which \( P \) and \( Q \) are unary predicate symbols, \( R, S \), and \( T \) are binaty predicate symbols, \( d, b \), c, df constant symbols, and \( x \) and \( y \) are variables: - \( T(x, y), S(x, y), \operatorname{not} Q(x) \rightarrow R(x, y) \) - \( P(x), Q(y) \rightarrow S(x, y) \) \( \rightarrow T(a, b) \) \( \rightarrow T(b, c) \) \( \rightarrow T(b, d) \) - \( \rightarrow P(a) \) - \( \rightarrow P(b) \) - \( \rightarrow Q(a) \) - \( \rightarrow Q(d) \) Which of the following statements is true, given the following assumptions: - the first (leftmost) query atom is always chosen for resolution; - the first (topmost) listed rule or fact that matches is chosen for resolution; - in the event of failure, backtrack to last choice point and choose next rule or fact that matchus. (i) Does the query ? \( R(x, y) \) succeed or fall? The query succeeds. The query fails. (ii) Enter how many times the procedure is required to backtrack to a choice point on the query \( ? R(x, y) ?(\mathrm{e} g, 0,1,2, \ldots) \)