2 Artificial Intelligence

Translate the following sentences into CNF

And show a trace of the running of the Davis-Putnam algorithm (DPLL)on the clauses that you have derived in above CNF(You are looking for hte set of all the clauses combined, not each sentences separately). When you come to a choice point, choose the first unbound symbols in alphabetical order, and try the question to TRUE before the Question to FALSE.

Translate the following sentences into CNF: 1. A(BC). 2. C (D V E). 3. D=>B 4. (DE)BA 5. D=E. After 5 fruitless attempts (red), choosing the variable assignment a=1,b=1 leads, after unit propagation (bottom), to success (green): the top left CNF formula is satisfiable