la) Differentiate conventional programming and Al programming,
b) Describe steepest Ascent Hill climbing algorithm with an example.
a) Discuss the characteristics of production system and give the state space representation for 8-puzzle.
b) Explain Alpha-Beta cut off with an example.
I a) Consider the following axioms.
i) Every bird sleeps in some tree.
ii) Every loon is a bird, and every loon is aquatic.
iii) Every tree in which any aquatic bird sleeps is beside some lake.
iv) Anything that sleeps in anything that is beside any lake eats fish.
Show the conclusion "Every loon eats fish" using resolution principle.
1 b) Illustrate the factors that are influencing forward and backward reasoning.
I a) Find the cumulative certainity factor for the hypothesis O and the evidences
el, e2, e3, e4 where
I Rule CF
I el 0.3
I c2 - 0.5
■ e3 - 0.7
I . e4 0.8
b) Discuss the approaches of conflict resolution.
1. sleep(bird,tree)
ReplyDelete2. bird(loon)
3. aquatic(loon)
4. sleep(aquatic,tree)->besidelake(z)
5. (sleeps(anything1,anything2) ^ besidelake(t) ) -> eat(anything1,fish)
Clausal form:
1.sleep(bird,tree)
2.bird(loon)
3.aquatic(loon)
4. ¬ sleep(aquatic,tree) V besidelake(z)
5. ¬ sleeps(anything1,anything2) V ¬ besidelake(t) V eat(anything1,fish)
To prove : eat(loon,fish)
¬ eat(loon,fish) (5)
anything1/loon
. ¬ sleeps(loon ,anything2) V ¬ besidelake(t) (4)
\ / t/z and anything2/tree
. ¬ sleeps(aqatic,tree) (3)
\ / aqatic/ loon
. ¬ sleeps(loon ,tree) (2)
\ / loon/ bird
¬ sleeps(bird ,tree) (1)
\ /
null
hence proved