Q. In Artificial Intelligence (AI), a simple reflex agent selects actions on the basis of ...................

View solution

Q. In heuristic search algorithms in Artificial Intelligence (AI), if a collection of admissible heuristics h1.......hm is available for a problem and none of them dominates any of the others, which should we choose?

View solution

Q. Consider following sentences regarding A*, an informed search strategy in Artificial Intelligence (AI).

(a) A* expands all nodes with f(n) < C*.
(b) A* expands no nodes with f(n) /C*.
(c) Pruning is integral to A*.

Here, C* is the cost of the optimal solution path.
Which of the following is correct with respect to the above statements?

View solution

Q. Consider a vocabulary with only four propositions A, B, C and D. How many models are there for the following sentence?

B V C

View solution

Q. Consider the following statements :

(a) False╞ True
(b) If α╞ (β ∧ γ) then α╞ β and α╞ γ.

Which of the following is correct with respect to the above statements?

View solution

Q. Consider the following English sentence:

“Agra and Gwalior are both in India”.

A student has written a logical sentence for the above English sentence in First-Order Logic using predicate In(x, y), which means x is in y, as follows:

In(Agra, India) V In(Gwalior, India)

Which one of the following is correct with respect to the above logical sentence?

View solution

Q. Consider the following two sentences:

(a) The planning graph data structure can be used to give a better heuristic for a planning problem.
(b) Dropping negative effects from every action schema in a planning problem results in a relaxed problem.

Which of the following is correct with respect to the above sentences?

View solution

Q. Consider the set of all possible five-card poker hands dealt fairly from a standard deck of fifty-two cards. How many atomic events are there in the joint probability distribution?

View solution

Q. In Artificial Intelligence (AI), which agent deals with happy and unhappy state?

View solution

Q. If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of greedy search?

View solution

Q. Let P, Q, R and S be Propositions. Assume that the equivalences P⇔(Q∨¬Q) and Q⇔R hold. Then the truth value of the formula (P∧Q)⇒((P∧R)∨S) is always :

View solution

Q. “If X, then Y unless Z” is represented by which of the following formulae in propositional logic?

View solution

Q. Consider the following two well-formed formulas in prepositional logic.

F1 : P ⇒ ¬ P
F2 : (P ⇒ ¬ P) ∨ (¬ P ⇒ P)

Which of the following statements is correct?

View solution

Q. Standard planning algorithms assume environment to be .................

View solution