Question

Mark all the TRUE statements about Prolog: It is a pure logic programming language. It accepts facts and rules as a set of axioms. It accepts user’s question as a conjectured theorem and tries to prove this theorem. Prolog rules cannot be recursive. It takes not(A) to be true if A cannot be shown to be true.

Answer 1

The answers are Option 1, Option 2 and Option 3.

 

The following statements are true about Prolog:

 

*It is a pure logic programming language.

*It accepts facts and rules as a set of axioms.

*It accepts user’s question as a conjectured theorem and tries to prove this theorem.

 

An important aspect to be noted about Prolog is that it is associated with computational linguistics and artificial intelligence.