Hey guys welcome to our new blog in this blog we are providing you the answer of NPTEL An introduction to artificial intelligence week 7 assignment solution.We are trying to give 100% correct answer so keep read my blogs for more.If you see any fault in our blog you can comment.
1.Which of the following statements is correct regarding Conjunction Normal Form?
(A) It is a conjunction of disjunction clauses
(B) It is a disjunction of conjunction clauses
(C)Empty clause indicates true
(D)Empty clause indicates false
Answer :-
2.Which of the following statements are true, according to the definitions of satisfiability, validity and entailment mentioned in the lectures?
(A) S is not valid if ¬S is satisfiable
(B)S is valid if ¬S is unsatisfiable
(C) S is satisfiable if ¬S is unsatisfiable
(D) S is valid if ¬S is not valid
Answer :-
3.Which of the following clauses can be entailed by the given set of clauses?
{(a,¬b, c) , (b, ¬c) , (¬b, c) , (b, c)}
(a)
(b)
(c)
(d)
Answer :-
4.Assume you are running the DPLL algorithm, with MOM’s heuristic on the following CNF formula. What is the next variable to be branched on?
{ (a, ¬b, c) , (¬b, c) , (¬c, d, ¬e) , (¬a, ¬b, e) , (a, ¬b, ¬c) , (d, b) , (e, a) }
a
b
c
d
Answer :-
5.In the previous question, assume that you set your selected variable to True. What is the formula you will obtain after the assignment, followed by repetitively eliminating all unit and pure literals?
(A) { (a, c) , (¬c, d, ¬e) , (¬a, e) , (a, ¬c) , (e, a) }
(B) { (¬c, d, ¬e) , (d, b) , (e, a) }
(C) { (d, ¬e) , (¬a, e) , (a, c) , (e, a) }
(D) { }
Answer :-
6.Which of the following statements is/are correct about WalkSAT algorithm?
(A) The number of clauses satisfied increases by at least one in every move.
(B) WalkSAT can detect if the problem is unsatisfiable.
(C) It is asymptotically complete.
(D) It is sound.
Answer :-
7.GSAT is an example of which of the following:
(A) Hill-Climbing with random restarts
(B) Random Walk
(C) Hill Climbing with random walk
(D) Genetic Algorithm
Answer :- B
8.Which of the following are correct about the soundness and completeness of Resolution (RE) and Forward Chaining (FC) as proof systems for inference in logic?
(A) RE is complete.
(B) RE is sound
(C) FC is complete.
(D) FC is sound
Answer :-
9.Which of the following statements are correct about the ontological and epistemological characteristics of First order logic (FOL) and Probabilistic Propositional Logic/Bayesian Networks (BN)?
(A) FOL and BN have similar ontology
(B) FOL and BN have different ontology
(C) FOL and BN have similar epistemology
(D) FOL and BN have different epistemology
Answer :-
10.Which of the following is an equivalent CNF form of the formula (p -> q) -> (p -> r) ?
(A) (p ^ ¬q) V (¬p V r)
(B) (¬q V ¬p V r)
(C) (¬p V q) ^ (¬p V r)
(D) r ^ (¬q V ¬p V r)
Answer :-