Recent questions in Artificial Intelligence

The statement form $(p \Leftrightarrow r) \Rightarrow(q \Leftrightarrow r)$ is equivalent to$[(\sim p \vee r) \wedge(p \vee \sim r)] \vee \sim[(\sim q \vee r) \wedge(q \v...

Which of the following formulas is a formalization of the sentence:"Every connected and circuit-free graph is a tree"Where $\operatorname{cir}(\mathrm{x})$ means " x has ...

Given the statement form below where $p, q, r, s$ are statement variables,$$\Biggl(\biggl(\Bigl((p \rightarrow q) \rightarrow(q \rightarrow r)\Bigl) \rightarrow(r \righta...

The island of Wantuutrewan is inhabited by exactly two types of natives: knights who always tell the truth and knaves who always lie. Every native is a knight or a knave,...

Given the following where $p, q, r, s, t$ are statement variables:(i) $(\sim r \rightarrow \sim r) \vee(\sim q \rightarrow q) \vee(t \rightarrow \sim t)$(ii) $(p \wedge q...

Assume the domain is $\mathbb{R}$. Which of the following statements are true?$\forall x \exists y(x y=1)$$\exists x \forall y\left(x^{2} \geq y^{2}\right)$$\exists x \fo...

Let $S$ be the set of students and $x \in S$. We define the following predicates:$\operatorname{SoC}(x): x$ is a computing student;$\operatorname{CS} 1231(x): x$ has take...

Which of the following statements are true?$\sim(p \rightarrow q) \equiv(p \vee(p \rightarrow \sim q))$$(p \rightarrow(q \vee r)) \leftrightarrow((p \wedge \sim q) \right...

Consider a search problem $\left(S, A, Succ, s_{0}, G\right)$, where all actions have cost 1. $S$ is the set of states, $A(s)$ is the set of legal actions from a state $s...

Which of the following statements is/are TRUE?For a search problem, the path returned by uniform cost search may change if we add a positive constant $C$ to every step co...

Which of the following algorithms is/are guaranteed to give an optimal solution ( given no negative edges )?Greedy Best First Search$\mathrm{A}^{*}$ with zero heuristic$\...

For a game tree where each node has $b$ children and a $d$-ply lookahead is performed, what is the number of leaf nodes to be examined?$b * d$$b^{d}$$d^{b}$$b+d$

Consider the two-player zero-sum game with elements of chance represented by the following tree. Triangles pointing up are max nodes, triangles pointing down are min node...

Consider the $A^{*}$ tree search algorithm with $f(n)=(2+x) \cdot g(n)+\left(x^{2}\right) \cdot h(n)$where $g(n)$ is the cost from the start state to state $n$ and $h(n)$...

Consider the min-max tree in Figure, A to EE are numbers on the leaf, and the numbers for leaf are shown in the last row.Which nodes get pruned if you use alpha-beta prun...

Consider the following two statements:$\textbf{S}_1$: The minimax procedure, without alpha-beta pruning, will always identify the best move for the player whose turn it i...

Consider the minimax game tree shown below. Decisions by MAX are represented as upward-pointing triangles; decisions by MIN are represented as downward-pointing triangles...

Consider an infinite search space $\mathbb{Z} \times \mathbb{Z}$. The start state is at $(0,0)$ and the goal state is at $\left(\mathrm{g_{x}, g_{y}}\right)$. Given that ...

Consider the following search problem:Node$h_0$$h_1$$h_2$S056A035B042C025D053G000Which of the heuristics are admissible?$\mathrm{h_0}$$\mathrm{h_1}$$\mathrm{h_2}$None of ...

Consider the following graph in which we are searching from start state $\mathrm{A}$ to the goal state $\mathrm{J}$. What is the number of nodes generated by Iterative De...