‘α |= β ‘(to mean that the sentence α entails the sentence β) if and only if, in every model in which α is….. β is also…
a) True, true
b) True, false
c) False, true
d) False, false
Explanation: Refer the definition of law of entailment.
Which is not a property of representation of knowledge?
a) Representational Verification
b) Representational Adequacy
c) Inferential Adequacy
d) Inferential Efficiency
Which is not Familiar Connectives in First Order Logic?
a) and
b) iff
c) or
d) not
Explanation: “not” is coming under propositional logic and is therefore not a connective.
Inference algorithm is complete only if
a) It can derive any sentence
b) It can derive any sentence that is an entailed version
c) It is truth preserving
d) It can derive any sentence that is an entailed version & It is truth preserving
An inference algorithm that derives only entailed sentences is called sound or truth-preserving.
a) True
b) False
Inference in First-Order Logic:
