0% found this document useful (0 votes)
28 views2 pages

Question Bank 3,4,5 AI

Uploaded by

Basavaraj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
28 views2 pages

Question Bank 3,4,5 AI

Uploaded by

Basavaraj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Question Bank 3, 4, 5

Artificial Intelligence

1) Explain the concept of Wumpus World and describe all possible state spaces to reach the safe
state in identifying the glitter.
2) Explain the forward chaining algorithm and proof tree constructed on the crime example
3) Explain two approaches to searching for a plan in state – space search.
4) Explain the backward chaining algorithm and proof tree constructed West is criminal.
5) Explain A BNF (Backus-Naur Form) grammar of sentences in propositional logic and write the
truth table enumeration for deciding propositional entailment
6) Explain Unification. Write a unification algorithm to compare the structure of input element by
element.
7) Explain different types of quantifiers with examples
8) Explain the planning graph for the “have cake and eat cake too” problem up to level S2
9) Write PPL description for an air cargo transportation planning problem
10) Explain the knowledge engineering process with respect to digital circuit ,purporting to be a one
bit full adder

i) (A ∨ B) ∧ (¬C ∨ ¬D ∨ E) |= (A ∨ B ∨ C) ∧ (B ∧ C ∧ D ⇒E)
11) Which of the following are correct?

ii) (A ∨ B) ∧ (¬C ∨ ¬D ∨ E) |= (A ∨ B) ∧ (¬D ∨ E).


iii) (C ∨ (¬A ∧ ¬B)) ≡ ((A ⇒ C) ∧ (B ⇒ C)).
iv) (A ∧ B) |= (A ⇔ B).
v) (A ∧ B) ⇒ C |= (A ⇒ C) ∨ (B ⇒ C)
12) Illustrate Unification and lifting. Write the examples for SUBS () and UNIFY () functions.
13) Explain Numbers, sets and lists. Represent the below sentences using FOL
i) The only sets are the empty set and those made by adjoining something to a set
ii) A set is a subset of another set if and only if all of the first set’s members are members of the
second set
iii) An object is in the union of two sets if and only if it is a member of either set
14) Write First order logic’s for these sentences
i) A circuit has terminals, up to its input and output arity, and nothing beyond its arity
ii) An OR gate’s output is 1 if and only if any of its inputs is 1
iii) Every student who takes French passes it.
iv) There is a barber who shaves all men in town who do not shave themselves
v) Politicians can fool some of the people all of the time, and they can fool all of the people
some of the time, but they can’t fool all of the people all of the time
15) Explain the steps involved in knowledge engineering process
16) Write PDDL description of simple spare tire problem.
17) Write an algorithm for forward chaining for propositional logic.
18) Illustrate the Graph plan algorithm and planning graph for the spare tire problem
19) Write an algorithm for forward chaining for propositional logic.
20) . Explain the following:
i. Kingship domain
ii. Equality
iii. Diagnostic rules
iv. Causal rules
21) Write an algorithm for simple resolution for propositional logic
22) Explain the model for first order logic and syntax of first order logic specified in Backus-
Naur form.
23) . Explain the following:
i. Term
ii. Atomic sentences
iii Complex sentences
iv. Nested quantifiers
24) Write the unification Algorithm.

You might also like