The maximum depth to which the alpha$-$beta pruning can be applied.

A$)$ Eight states

B$)$ Six states

C$)$ Ten states

D$)$ Any depth

Among the given options, which is also known as inference rule?

A$)$ Reference

B$)$ Reform

C$)$ Resolution

D$)$ None of the above

Which of the following option is used to build complex sentences in knowledge representation?

A$)$ Symbols

B$)$ Connectives

C$)$ Quantifier

D$)$ None of the above

Automatic Reasoning tool is used in

A$)$ Personal Computers

B$)$ Microcomputers

C$)$ LISP Machines

D$)$ All of the above

If according to the hypothesis, the result should be positive, but in fact it is negative, then it is known as

A$)$ False Negative Hypothesis

B$)$ False Positive Hypothesis

C$)$ Specialized Hypothesis

D$)$ Consistent Hypothesis

A hybrid Bayesian Network consist

A$)$ Discrete variables only

B$)$ Discontinuous Variable

C$)$ Both Discrete and Continuous variables

D$)$ Continuous Variable only

The process of capturing the inference process as Single Inference Rule is known as:

A$)$ Clauses

B$)$ Ponens

C$)$ Generalized Modus Ponens

D$)$ Variables

Which process makes two different Logical expressions look identical?

A$)$ Unification

B$)$ Lifting

C$)$ Inference Process

D$)$ None of the above

Which algorithm takes two sentences as input and returns a Unifier?

A$)$ Inference

B$)$ Hill$-$Climbing

C$)$ Unify algorithm

D$)$ Depth$-$first search

The PEAS in the task environment is aboul

A$)$ Peer, Environment, Actuators, Sense

B$)$ Performance, Environment, Actuators, Sensors

C$)$ Perceiving, Environment, Actuators, Sensors

D$)$ None of the above

In state$-$space, the set of actions for a given problem is expressed by the

A$)$ Intermediate States

B$)$ Successor function that takes current action and returns next state

C$)$ Initial States

D$)$ None of the above

In which search problem, to find the shortest path, each city must be visited once only?

A$)$ Map coloring Problem

B$)$ Depth$-$first search traversal on a given map represented as a graph

C$)$ Finding the shortest path between a source and a destination

D$)$ Travelling Salesman problem