Explanation: Logic programming can be constructed by expressing knowledge in a formal expression and the problem can be solved by running inference process. 9. What form of negation does the prolog allows?
A. Negation as failure
B. Proposition
C. Substitution
D. Negation as success
Answer:A
Explanation: Logic programming can be constructed by expressing knowledge in a formal expression and the problem can be solved by running inference process. 9. What form of negation does the prolog allows?
A. Negation as failure B. Proposition C. Substitution D. Negation as success
Explanation: None. 10. Which is omitted in prolog unification algorithm?