Que- The basic inference mechanism in semantic network in which knowledge is represented as Frames is to follow the links between the nodes.
a. TRUE
b. False
c. Nothing can be said
d. None of the mentioned
Ans- TRUE
Que- There exists two way to infer using semantic networks in which knowledge is represented as Frames.1) Intersection Search2) Inheritance Search
a. TRUE
b. False
c. Nothing can be said
d. None of the mentioned
Ans- TRUE
Que- Following is an extension of the semantic network.
a. Expert Systems
b. Rule Based Expert Systems
c. Decision Tree Based networks
d. Partitioned Networks
Ans- Partitioned Networks
Que- Basic idea of an partitioned nets is to break network into spaces which consist of groups of nodes and arcs and regard each space as a node.
a. TRUE
b. False
c. Nothing can be said
d. None of the mentioned
Ans- TRUE
Que- Semantic Network represents
a. Syntactic relation between concepts
b. Semantic relations between concepts
c. All of the mentioned
d. None of the mentioned
Ans- Semantic relations between concepts
Que- A semantic network is used when one has knowledge that is best understood as a set of concepts that are related to one another.
a. TRUE
b. False
c. Nothing can be said
d. None of the mentioned
Ans- TRUE
Que- What are the limitations of the semantic networks?
a. Intractability
b. Lack in expressing some of the properties
c. Incomplete
d. Has memory constraints
Ans- Lack in expressing some of the properties
Que- What among the following is/are the best example of semantic networks?
a. Wordnet
b. Human Food Chain
c. MYSIN
d. Autonomous car driver
Ans- Wordnet
Que- Semantic Network is also known as Frame networks.
a. TRUE
b. False
c. Nothing can be said
d. None of the mentioned
Ans- TRUE
Que- Synonymy relation means,
a. A is part of B
b. A denotes same as B
c. A is a kind of B
d. A is superordinate of B
Ans- A denotes same as B
Que- Antonymy relation means,
a. A is part of B
b. B has A as a part of itself
c. A denotes opposite of B
d. A is superordinate of B
Ans- A denotes opposite of B
Que- Most semantic networks are not cognitive base
d.
a. TRUE
b. False
c. Nothing can be said
d. None of the mentioned
Ans- False
Que- Frames is
a. A way of representing knowledge
b. Data Structure
c. Data Type
d. None of the mentioned
Ans- A way of representing knowledge
Que- Frames in artificial intelligence is derived from semantic nets.
a. TRUE
b. False
c. Nothing can be said
d. None of the mentioned
Ans- TRUE
Que- What is the process of capturing inference process as a single inference rule?
a. Ponens
b. Clauses
c. Generalized Modus Ponens
d. Variables
Ans- Generalized Modus Ponens
Que- Which process makes different logical expression looks identical?
a. Lifting
b. Unification
c. Inference process
d. None of the mentioned
Ans- Unification
Que- Which algorithm takes two sentences and returns an unifier?
a. Inference
b. Hill-climbing search
c. Depth-first search
d. Unify algorithm
Ans- Unify algorithm
Que- Which is a lifted version of modus ponens?
a. Generalized modus ponens
b. Inference
c. Clauses
d. None of the mentioned
Ans- Generalized modus ponens
Que- Which is unique up to renaming of variables?
a. Unifier
b. Most general unifier
c. Unifier & Most general unifier
d. None of the mentioned
Ans- Most general unifier
Que- Which makes the complexity of the entire algorithm quadratic in the size?
a. Clause
b. Inference
c. Resolution
d. Occur check
Ans- Occur check
Que- How many functions are available in the unification and lifting process?
a. 1
b. 2
c. 3
d. 4
Ans- 4
Que- Where did all the facts are stored to implement store and fetch function?
a. Database
b. Knowledge base
c. Datamart
d. All of the mentioned
Ans- Knowledge base
Que- What is meant by predicate indexing?
a. All the one kind of facts in one bucket and another kind in other bucket
b. Acts like index for facts
c. All of the mentioned
d. None of the mentioned
Ans- All the one kind of facts in one bucket and another kind in other bucket
Que- How the buckets are stored in predicate indexing?
a. Lists
b. Stack
c. Hashes
d. None of the mentioned
Ans- Hashes
Que- The process by which the brain incrementally orders actions needed to complete a specific task is referred as,
a. Planning problem
b. Partial order planning
c. Total order planning
d. Both Planning problem & Partial order planning
Ans- Partial order planning
Que- To complete any task, the brain needs to plan out the sequence by which to execute the behavior. One way the brain does this is with a partial-order plan. State whether true or false.
a. TRUE
b. False
c. Nothing can be said
d. None of the mentioned
Ans- TRUE
Que- In partial order plan.A. Relationships between the actions of the behavior are set prior to the actionsB. Relationships between the actions of the behavior are not set until absolutely necessaryChoose the correct option.
a. A is true
b. B is true
c. Either A or B can be true depending upon situation
d. Neither A nor B is true
Ans- A is true
Que- Partial-order planning exhibits the Principle of Least Commitment, which contributes to the efficiency of this planning system as a whole.
a. TRUE
b. False
c. Nothing can be said
d. None of the mentioned
Ans- TRUE
Que- Following is/are the components of the partial order planning.
a. Bindings
b. Goal
c. Causal Links
d. All of the mentioned
Ans- All of the mentioned
Que- Partial-order planning is the opposite of total-order planning.
a. TRUE
b. False
c. Nothing can be said
d. None of the mentioned
Ans- TRUE
Que- Sussman Anomaly can be easily and efficiently solved by partial order planning.
a. TRUE
b. False
c. Nothing can be said
d. None of the mentioned
Ans- TRUE
Que- Sussman Anomaly illustrates a weakness of interleaved planning algorithm.
a. TRUE
b. False
c. Nothing can be said
d. None of the mentioned
Ans- False
Que- One the main drawback of this type of planning system is that it requires a lot of computational powers at each node.
a. TRUE
b. False
c. Nothing can be said
d. None of the mentioned
Ans- TRUE
Que- What are you predicating by the logic: Û·x: €y: loyalto(x, y).
a. Everyone is loyal to someone
b. Everyone is loyal to all
c. Everyone is not loyal to someone
d. Everyone is loyal
Ans- Everyone is loyal to someone
Que- A plan that describe how to take actions in levels of increasing refinement and specificity is
a. Problem solving
b. Planning
c. Non-hierarchical plan
d. Hierarchical plan
Ans- Hierarchical plan
Que- A constructive approach in which no commitment is made unless it is necessary to do so, is
a. Least commitment approach
b. Most commitment approach
c. Nonlinear planning
d. Opportunistic planning
Ans- Least commitment approach
Que- Uncertainty arises in the Wumpus world because the agent's sensors give only
a. Full & Global information
b. Partial & Global Information
c. Partial & local Information
d. Full & local information
Ans- Partial & local Information
Que- Which of the following search belongs to totally ordered plan search?
a. Forward state-space search
b. Hill-climbing search
c. Depth-first search
d. Breadth-first search
Ans- Forward state-space search
Que- Which cannot be taken as advantage for totally ordered plan search?
a. Composition
b. State search
c. Problem decomposition
d. None of the mentioned
Ans- Problem decomposition
Que- What is the advantage of totally ordered plan in constructing the plan?
a. Reliability
b. Flexibility
c. Easy to use
d. All of the mentioned
Ans- Flexibility
Que- Which strategy is used for delaying a choice during search?
a. First commitment
b. Least commitment
c. Both First & Least commitment
d. None of the mentioned
Ans- Least commitment
Que- Which algorithm place two actions into a plan without specifying which should come first?
a. Full-order planner
b. Total-order planner
c. Semi-order planner
d. Partial-order planner
Ans- Partial-order planner
Que- How many possible plans are available in partial-order solution?
a. 3
b. 4
c. 5
d. 6
Ans- 6
Que- What is the other name of each and every total-order plans?
a. Polarization
b. Linearization
c. Solarization
d. None of the mentioned
Ans- Linearization
Que- What are present in the empty plan?
a. Start
b. Finish
c. Modest
d. Both Start & Finish
Ans- Both Start & Finish
Que- What are not present in start actions?
a. Preconditions
b. Effect
c. Finish
d. None of the mentioned
Ans- Preconditions
Que- What are not present in finish actions?
a. Preconditions
b. Effect
c. Finish
d. None of the mentioned
Ans- Effect
Que- Which can be adapted for planning algorithm?
a. Most-constrained variable
b. Most-constrained literal
c. constrained
d. None of the mentioned
Ans- Most-constrained variable