Q. An optimal assignment requires that the minimum number of horizontal and vertical lines that can be drawn to cover all zeros be equal to the number of

View solution

Q. The tracing model in Prolog describes program execution in terms of certain events. These events are

View solution

Q. Which of the following shall be a compound proposition involving the propositions p, q and r, that is true when exactly two of the p, q and r are true and is false otherwise?

View solution

Q. The truth value of the statements:

∃!xP(x)→∃xP(x) and ∃!x˥P(x)→˥∀xP(x), (where the notation ∃!xP(x) denotes the proposition "There exists a unique x such that P(x) is true'') are:

View solution

Q. Horn clauses are special kinds of propositions which can be described as

View solution

Q. Which of the following is/are the fundamental semantic model(s) of parameter passing?

View solution

Q. Which one of the following is a correct implementation of the metapredicate “not” in PROLOG (Here G represents a goal) ?

View solution

Q. Which one of the following is not an informed search technique?

View solution

Q. If we convert

∃u ∀v ∀x ∃y (P(f(u),v, x, y) → Q(u,v,y)) to
∀v ∀x (P(f(a),v, x, g(v,x)) → Q(a,v,g(v,x)))

This process is known as

View solution

Q. Given two jugs of capacities 5 litres and 3 litres with no measuring markers on them. Assume that there is endless supply of water. Then the minimum number of states to measure 4 litres water will be

View solution

Q. The map colouring problem can be solved using which of the following technique?

View solution

Q. Which of the following is a knowledge representation technique used to represent knowledge about stereotype situation?

View solution

Q. A* algorithm uses f ' = g + h' to estimate the cost of getting from the initial state to the goal state, where g is a measure of the cost of getting from initial state to the current node and the function h' is an estimate of the cost of getting from the current node to the goal state. To find a path involving the fewest number of steps, we should set

View solution

Q. Which one of the following prolog programs correctly implement “if G succeeds then execute goal P else execute goal q ?”

View solution

Q. The strategy used to reduce the number of tree branches and the number of static evaluations applied in case of a game tree is

View solution

Q. An example of a tautology is:

View solution

Q. The preposition (p→q) ˄ (~q˅p) is equivalent to:

View solution

Q. If the proposition 7P⇒Q is true, then the truth value of the proposition 7PV(P⇒Q) is:

View solution

Q. Which of the following checks cannot be carried out on the input data to a system ?

View solution

Q. A fact in prolog is a special case of a:

View solution