ARTIFICIAL INTELLIGENCE: KNOWLEDGE REPRESENTATION AND REASONING NPTEL WEEK 2 QUIZ ASSIGNMENT SOLUTION 2022...



 1) When we say that logic is formal we mean that:

solution) a conclusion is acceptable based only on the form of the argument

              arguments in logic have vigour


2) By a knowledge Base (KB)  we mean:

solution) a set of sentences all of  which are accepted to be true

               a set of premises or axioms


3) Entailment entails:

solution) stating that a sentence alpha is necessarily true given a KB


4) A proof in logic 

solution) involves the use of  rules of inference on a given KB

                involves a syntactic process devoid of truth values of a sentence

                Involves a syntactic process devoid of meaning of sentence


5) The logic machine is a set of rules of inference  operating on a given set of sentences.We can say that the logic machine is sound if

solution) it can derive only true sentences

               it cannot derive any false sentences


6) The logic machine is a set of rules of inference  operating on a given set of sentences.We can say that the logic machine is complete if

solution) it can derive all true statements


7) A valid rule of inference

solution) is a basis of a deductive inference

                is based on a tautological implication

                is a sound rule of inference

8) Which of the following are atomic sentences with propositional logic(PL)

solution) The giraffe is a vegetable 

                The Moon is larger than the Sun

              


9) Given the following two true statements, is the conclusion valid? Please type Y or N in space provided

a. If Amogh ran for 21 km the he would be tired

b. Amogh is not tired 

c. Therefore, he did not run for 21km.

solution) Y


10) Given the following two true statements, is the conclusion valid? Please type Y or N in space provided.

a. If the tea were to be cold the Shashank will not drink it.

b. Shashank did not drink the tea.

c. Therefore, tea is cold

solution) N


11) In the Tableau method if no branch of the tableau being constructed for a formula alpha is closed, it means that 

solution) alpha is satifiable 

Post a Comment

0 Comments