ARTIFICIAL INTELLIGENCE
[ SUBJECT CODE: 2180703 ]
CH-4 LOGICAL AGENT
Topics Covers:-
Representation Simple Facts In Logic, Representing Instance And Isa
Relationships, Commutable Functions And Predicates,
Resolution.
MCQ:-
1.First Order Logic is also known as ___________
a) First Order Predicate Calculus
b) Quantification Theory
c) Lower Order Calculus
d) All of the mentioned
2.Which is used to construct the complex sentences?
a) Symbols
b) Connectives
c) Logical connectives
d) All of the mentioned
3.How many proposition symbols are there in artificial intelligence?
a) 1
b) 2
c) 3
d) 4
4.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
5.Which are needed to compute the logical inference algorithm?
a) Logical equivalence
b) Validity
c) Satisfiability
d) All of the mentioned
6.Which form is called as a conjunction of dis junction of literals?
a) Conjunctive normal form
b) Disjunctive normal form
c) Normal form
d) All of the mentioned
7.How to eliminate the redundant rule matching attempts in the forward chaining?
a) Decremental forward chaining
b) Incremental forward chaining
c) Data complexity
d) None of the mentioned
8.How many possible sources of complexity are there in forwardchaining?
a) 1
b) 2
c) 3
d) 4
9.Which is mainly used for automated reasoning?
a) Backward chaining
b) Forward chaining
c) Logic programming
d) Parallel programming
10.Which algorithm are in more similar to backward chaining algorithm?
a) Depth-first search algorithm
b) Breadth-first search algorithm
c) Hill-climbing search algorithm
d) All of the mentioned
11.Which problem can frequently occur in backward chaining algorithm?
a) Repeated states
b) Incompleteness
c) Complexity
d) Both Repeated states & Incompleteness
12.Which is omitted in prolog unification algorithm?
a) Variable check
b) Occur check
c) Proposition check
d) Both Occur & Proposition check
13.What form of negation does the prolog allows?
a) Negation as failure
b) Proposition
c) Substitution
d) Negation as success
14.Which is a refutation complete inference procedure for propositional logic?
a) Clauses
b) Variables
c) Propositional resolution
d) Proposition
15.What is the condition of literals in variables?
a) Existentially quantified
b) Universally quantified
c) Quantified
d) None of the mentioned
16.Which can be converted to inferred equivalent CNF sentence?
a) Every sentence of propositional logic
b) Every sentence of inference
c) Every sentence of first-order logic
d) All of the mentioned
17.Which sentence will be unsatisfiable if the CNF sentence is unsatisfiable?
a) Search statement
b) Reading statement
c) Replaced statement
d) Original statement
18.At which state does the propositional literals are complementary?
a) If one variable is less
b) If one is the negation of the other
c) All of the mentioned
d) None of the mentioned
19.What is meant by factoring?
a) Removal of redundant variable
b) Removal of redundant literal
c) Addition of redundant literal
d) Addition of redundant variable
20.What will happen if two literals are identical?
a) Remains the same
b) Added as three
c) Reduced to one
d) None of the mentioned
21.When the resolution is called as refutation-complete?
a) Sentence is satisfiable
b) Sentence is unsatisfiable
c) Sentence remains the same
d) None of the mentioned
22.How the logic programming can be constructed?
a) Variables
b) Expressing knowledge in a formal language
c) Graph
d) All of the mentioned
23.What is used in backward chaining algorithm?
a) Conjuncts
b) Substitution
c) Composition of substitution
d) None of the mentioned
24.How can be the goal is thought of in backward chaining algorithm?
a) Queue
b) List
c) Vector
d) Stack
25.From where did the new fact inferred on new iteration is derived?
a) Old fact
b) Narrow fact
c) New fact
d) All of the mentioned
More MCQ Uploading Soon...
Stay Tune
Comment Your View In Below Section..
it's Very Helpful...
ππππππ good job
ReplyDeleteπππ
ReplyDelete