Bihar STET Computer Science – Artificial Intelligence Set 1

Questions 56-60 of 100

0% completed (0/100 answered)
Your score 0/100 0 answered
Correct 0 Incorrect 0 Unanswered 100 Accuracy 0%

Question 56

MCQ · Single Correct 1 mark

The symbol '∃' in First-Order Logic represents:

Answers for question 56

Question 57

MCQ · Single Correct 1 mark

In First-Order Logic, replacing existential quantifiers with Skolem functions or constants during CNF conversion is called:

Answers for question 57

Question 58

MCQ · Single Correct 1 mark

Unification in First-Order Logic is the algorithmic process of:

Answers for question 58

Question 59

MCQ · Single Correct 1 mark

A clause consisting of at most one positive literal is known as a:

Answers for question 59

Question 60

MCQ · Single Correct 1 mark

Resolution proof by contradiction proves KB |= $\alpha$ by demonstrating that:

Answers for question 60
Scroll to Top