|
In this video we look at more complicated patterns of implications, and introduce a method for counting the satisfying valuations.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
In this video we look at the next simplest example, chains of implications between atoms. We introduce the arrow rule.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
In this video we focus on binary constraints: clauses with two literals. A 2-SAT problem is a conjunction of binary constraints. We will represent it as a partial ordering on literals.In this video…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
We return to the example introduced in the previous video, and begin to represent the problem in Haskell.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
This video introduces the key idea behind the DLPP algorithm. If we decide to make some literal true, we may reduce the problem to a simpler problem. We will build our DPLL algorithm by using this…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
Welcome - Week 1
Course Code
PA1.2x Evaluation of Predictive Modelling Licence Type
Creative Commons - Attribution Share A Like Language
English
|
|
Confusion Matrix - Week 1
Course Code
PA1.2x Evaluation of Predictive Modelling Licence Type
Creative Commons - Attribution Share A Like Language
English
|