Contents

A network with named nodes and labeled arcs that can be used to represent certain natural language grammars to facilitate parsing.
a) Tree Network  
b) Star Network
c) Transition Network

c

Linguistics:


Which of the following is true related to ‘Satisfiable’ property?
a) A statement is satisfiable if there is some interpretation for which it is false
b) A statement is satisfiable if there is some interpretation for which it is true
c) A statement is satisfiable if there is no interpretation for which it is true
d) A statement is satisfiable if there is no interpretation for which it is false

b

Explanation: ‘Satisfiable’ property is a statement is satisfiable if there is some interpretation for which it is true.


Two literals are complementary if……
a) They are equal
b) They are identical and of equal sign
c) 
They are identical but of opposite sign
d) They are unequal but of equal sign

c

Explanation: Two literals are complementary if They are identical but of opposite sign.


Consider a good system for the representation of knowledge in a particular domain. What property should it possess?
a) Representational Adequacy
b) Inferential Adequacy
c) Inferential Efficiency
d) All of the mentioned

d

Explanation: Consider a good system for the representation of knowledge in a particular domain. The properties should be Representational Adequacy, Inferential Adequacy, Inferential Efficiency and Acquisitional Efficiency.


What is Transposition rule?
a) From P → Q, infer ~Q → P
b) From P → Q, infer Q → ~P
c) From P → Q, infer Q → P
d) From P → Q, infer ~Q → ~P

d

Explanation: Transposition rule- From P → Q, infer ~Q → ~P.