# Search for tag: "cnf"

#### 13.b

The second video on the first Inf2d lecture on Resolution.

From  Claudia-Elena Chirita 0 likes 192 plays 0

#### CL - 14a - Tseytin Week 9

In the second video, we show how the Tesytin procedure can be implemented elegantly in Haskell.

From  Haoran Peng 0 likes 299 plays 0

#### CL - 11e - CNF by KM (II)

Description Pending

From  Haoran Peng 0 likes 207 plays 0

#### CL - 11d - Tseytin

Description Pending

From  Haoran Peng 0 likes 314 plays 0

#### CL - 11b - CNF by Boolean algebra

Description Pending

From  Haoran Peng 0 likes 269 plays 0

#### CL - 9c - DPLL II

We return to the example introduced in the previous video, and begin to represent the problem in Haskell.

From  Haoran Peng 0 likes 267 plays 0

#### CL - 9b - Sudoku III

Sudoku is just a game, but it a good, accessible example of a type of problem that of great practical significance. Here we discuss the Sudoku problem within this wider context.

From  Haoran Peng 0 likes 263 plays 0

#### CL - 9a - Recap

This video is a brief recap of most of the logic we have covered so far. You may find it useful, to jog your memory and check your understanding.

From  Haoran Peng 0 likes 362 plays 0

#### CL - 6g - CNF II

This video shows how to use a Karnaugh map to represent an arbitrary Boolean function of four variables as a conjunctive normal form (CNF) — a conjunction of disjunctions of literals.

From  Haoran Peng 0 likes 394 plays 0

#### CL - 6f - CNF I

This video shows how blocks of zeros, which correspond to disjund=ctions of literals, lead us to conjunctive normal form (CNF) which we met earlier as the output of our reduction procedure. CNF is in…

From  Haoran Peng 0 likes 470 plays 0