Deck 2: Knowledge Representation and Inference Mechanisms in Artificial Intelligence
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/23
Play
Full screen (f)
Deck 2: Knowledge Representation and Inference Mechanisms in Artificial Intelligence
1
Which of the following are true for the algorithms Beam Stack Search (BSS)and Divide-and-Conquer Beam Stack Search (DCBSS).
A)bss finds the optimal path while dcbss does not.
B)dcbss finds the optimal path while bss does not.
C)both bss and dcbss find the optimal path
D)neither bss and dcbss find the optimal path
A)bss finds the optimal path while dcbss does not.
B)dcbss finds the optimal path while bss does not.
C)both bss and dcbss find the optimal path
D)neither bss and dcbss find the optimal path
both bss and dcbss find the optimal path
2
The performance of an agent can be improved by __________
A)learning
B)observing
C)perceiving
D)sensing
A)learning
B)observing
C)perceiving
D)sensing
learning
3
__________ Is an algorithm, a loop that continually moves in the direction of increasing value - that is uphill.
A)up-hill search
B)hill-climbing
C)hill algorithm
D)reverse-down-hill search
A)up-hill search
B)hill-climbing
C)hill algorithm
D)reverse-down-hill search
hill-climbing
4
Not only do formal logics allow representation of knowledge, but they also allow representation of knowledge Mechanisms for reasoning using a collection of well-defined manipulation rules Of Representations.
Unlock Deck
Unlock for access to all 23 flashcards in this deck.
Unlock Deck
k this deck
5
If a logic produces only true statements and does not produce any false statement it shows which of the following property
A)completeness
B)soundness
C)consistency
D)none of these
A)completeness
B)soundness
C)consistency
D)none of these
Unlock Deck
Unlock for access to all 23 flashcards in this deck.
Unlock Deck
k this deck
6
Is the following rule of inference valid one
Unlock Deck
Unlock for access to all 23 flashcards in this deck.
Unlock Deck
k this deck
7
_________Graph is used to represent semantic network
A)undirected
B)directed
C)undirected.
D)any one of the above
A)undirected
B)directed
C)undirected.
D)any one of the above
Unlock Deck
Unlock for access to all 23 flashcards in this deck.
Unlock Deck
k this deck
8
What is the nature of the sentence: ?x ?y (TeacherOf(x,y) ? StudentOf(y,x))
A)symmetry
B)exhaustiveness
C)inverse
D)none of the above
A)symmetry
B)exhaustiveness
C)inverse
D)none of the above
Unlock Deck
Unlock for access to all 23 flashcards in this deck.
Unlock Deck
k this deck
9
The formula or sentences that can be maid true by certain valuation function are called
A)valid formula
B)satisfiable formula
C)unsatisfiable formula
D)invalid formula
A)valid formula
B)satisfiable formula
C)unsatisfiable formula
D)invalid formula
Unlock Deck
Unlock for access to all 23 flashcards in this deck.
Unlock Deck
k this deck
10
A _________ is used to demonstrate, on a purely syntactic basis, that one formula is a logical consequence of another formula.
A)deductive systems
B)inductive systems
C)reasoning with knowledge based systems
D)search based systems
A)deductive systems
B)inductive systems
C)reasoning with knowledge based systems
D)search based systems
Unlock Deck
Unlock for access to all 23 flashcards in this deck.
Unlock Deck
k this deck
11
A Term is either an individual constant (a 0-ary function), or a variable, or an n-ary function applied to n terms: F(t1 t2 ..tn).
Unlock Deck
Unlock for access to all 23 flashcards in this deck.
Unlock Deck
k this deck
12
First Order Logic is also known as ___________
A)first order predicate calculus
B)quantification theory
C)lower order calculus
D)all of the mentioned
A)first order predicate calculus
B)quantification theory
C)lower order calculus
D)all of the mentioned
Unlock Deck
Unlock for access to all 23 flashcards in this deck.
Unlock Deck
k this deck
13
Which is used to compute the truth of any sentence?
A)semantics of propositional logic
B)alpha-beta pruning
C)first-order logic
D)both semantics of propositional logic & alpha-beta pruning
A)semantics of propositional logic
B)alpha-beta pruning
C)first-order logic
D)both semantics of propositional logic & alpha-beta pruning
Unlock Deck
Unlock for access to all 23 flashcards in this deck.
Unlock Deck
k this deck
14
From which rule does the modus ponens are derived?
A)inference rule
B)module rule
C)both inference & module rule
D)c.none of the mentioned
A)inference rule
B)module rule
C)both inference & module rule
D)c.none of the mentioned
Unlock Deck
Unlock for access to all 23 flashcards in this deck.
Unlock Deck
k this deck
15
Which form is called as a conjunction of disjunction of literals?
A)conjunctive normal form
B)disjunctive normal form
C)normal form
D)all of the mentioned
A)conjunctive normal form
B)disjunctive normal form
C)normal form
D)all of the mentioned
Unlock Deck
Unlock for access to all 23 flashcards in this deck.
Unlock Deck
k this deck
16
What can be viewed as a single lateral of disjunction?
A)multiple clause
B)combine clause
C)unit clause
D)none of the mentioned
A)multiple clause
B)combine clause
C)unit clause
D)none of the mentioned
Unlock Deck
Unlock for access to all 23 flashcards in this deck.
Unlock Deck
k this deck
17
What among the following constitutes the representation of the knowledge in different forms?
A)relational method where each fact is set out systematically in columns
B)inheritable knowledge where relational knowledge is made up of objects
C)inferential knowledge
D)all of the mentioned
A)relational method where each fact is set out systematically in columns
B)inheritable knowledge where relational knowledge is made up of objects
C)inferential knowledge
D)all of the mentioned
Unlock Deck
Unlock for access to all 23 flashcards in this deck.
Unlock Deck
k this deck
18
What are Semantic Networks?
A)a way of representing knowledge
B)data structure
C)data type
D)none of the mentioned
A)a way of representing knowledge
B)data structure
C)data type
D)none of the mentioned
Unlock Deck
Unlock for access to all 23 flashcards in this deck.
Unlock Deck
k this deck
19
Graph used to represent semantic network is _____________
A)undirected graph
B)directed graph
C)directed acyclic graph (dag)
D)directed complete graph
A)undirected graph
B)directed graph
C)directed acyclic graph (dag)
D)directed complete graph
Unlock Deck
Unlock for access to all 23 flashcards in this deck.
Unlock Deck
k this deck
20
The basic inference mechanism in semantic network is to follow the links between the nodes.
Unlock Deck
Unlock for access to all 23 flashcards in this deck.
Unlock Deck
k this deck
21
Which of the following elements constitutes the frame structure?
A)facts or data
B)procedures and default values
C)frame names
D)frame reference in hierarchy
A)facts or data
B)procedures and default values
C)frame names
D)frame reference in hierarchy
Unlock Deck
Unlock for access to all 23 flashcards in this deck.
Unlock Deck
k this deck
22
There exists two way to infer using semantic networks in which knowledge is represented as Frames.
A)intersection search
B)inheritance search
A)intersection search
B)inheritance search
Unlock Deck
Unlock for access to all 23 flashcards in this deck.
Unlock Deck
k this deck
23
Which problem can frequently occur in backward chaining algorithm?
A)repeated states
B)incompleteness
C)complexity
D)both repeated states & incompleteness
A)repeated states
B)incompleteness
C)complexity
D)both repeated states & incompleteness
Unlock Deck
Unlock for access to all 23 flashcards in this deck.
Unlock Deck
k this deck