Search for tag: "cnf"

13.b

The second video on the first Inf2d lecture on Resolution.

From  Claudia-Elena Chirita on February 8th, 2021 0 likes 154 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 on November 18th, 2020 0 likes 269 plays 0  

CL - 11e - CNF by KM (II)

Description Pending

From  Haoran Peng on November 12th, 2020 0 likes 197 plays 0  

CL - 11d - Tseytin

Description Pending

From  Haoran Peng on November 12th, 2020 0 likes 304 plays 0  

CL - 11b - CNF by Boolean algebra

Description Pending

From  Haoran Peng on November 12th, 2020 0 likes 255 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 on November 4th, 2020 0 likes 256 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 on November 4th, 2020 0 likes 245 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 on November 2nd, 2020 0 likes 346 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 on October 24th, 2020 0 likes 381 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 on October 24th, 2020 0 likes 450 plays 0