CSE 4301/5290 Homework 4Due: November 16, Wed, 5pm; Submit Server:course = ai , project = hw41. Q7.10, p 281, 3Ed; Q7.8, p237, 2Ed. For 3Ed, add partg: (Big∧Dumb)∨ ¬Dumb2. In proof by contradiction (using the resolution inferencerule), whenKB∧ ¬αisunsatisfiable, we knowαis true.What do we know aboutαwhenKB∧ ¬αissatisfiable?When can we know thatαis false? Explain your answers.3. Prove that:(a) (a∨b)∧(¬b∨c) entailsa∨c[correct “resolution”](b) (a∨b∨c)∧(¬b∨ ¬c∨d) does not entaila∨d.[incorrect “resolution”]4. Q7.2, p280, 3Ed; Q7.9, p238, 2Ed:Write sentences inpropositional logic, translate them into clauses, use res-olution to infer answers for the three queries.5. Programming (LISP, C, C++,Java):Given clauses(CNF) in propositional logic, use resolution with at leasttwo strategies to gain speed [described in the comments]to solve two problems:(a) Wumpus (p247, 3Ed; p208, 2Ed): The initial KBhasR1-R3; percepts areR4andR5; queries are:i. a pit at [1,2]?
This is the end of the preview.
access the rest of the document.