Which problem can frequently occur in backward chaining algorithm?
a) Repeated states
b) Incompleteness
c) Complexity
d) Both Repeated states & Incompleteness
Explanation: If there is any loop in the chain means, It will lead to incompleteness and repeated states.
How the logic programming can be constructed?
a) Variables
b) Expressing knowledge in a formal language
c) Graph
d) All of these
Explanation: Logic programming can be constructed by expressing knowledge in a formal expression and the problem can be solved by running inference process.
What form of negation does the prolog allows?
a) Negation as failure
b) Proposition
c) Substitution
d) Negation as success
Which is omitted in prolog unification algorithm?
a) Variable check
b) Occur check
c) Proposition check
d) Both Occur & Proposition check
Explanation: Occur check is omitted in prolog unification algorithm because of unsound inferences.
