Search for tag: "rules"

7.c

Third video of the Inf2D Reasoning and Agents lecture on Logical Agents.

From  Claudia-Elena Chirita on January 25th, 2021 0 likes 184 plays 0  

lecture 3 part 3 Kaltura Capture recording - January 24th 2021, 10:27:00 am

Lecture 3 part 3

From  Pauline Phemister on January 24th, 2021 0 likes 13 plays 0  

1.b

This is the second lecture video of Intelligent Agents and their Environments, presenting a taxonomy of agents based on their structure.

From  Claudia-Elena Chirita on January 9th, 2021 0 likes 240 plays 0  

CL - 22 - Tseytin Satisfaction DPLL

N/A

From  Haoran Peng on December 1st, 2020 0 likes 98 plays 0  

CL - 18 - rules

This is a raw video from 2019. I've not yet had time to edit it into chunks. If you have any questions, or find any errors, please let me know on Piazza.This lecture introduces a very important…

From  Haoran Peng on November 30th, 2020 0 likes 203 plays 0  

FP - Lecture 19 - Propositions as Types

This is the last FP video lecture, on Propositions as Types.

From  Claudia-Elena Chirita on November 29th, 2020 0 likes 350 plays 0  

CL - 15e - RS -- Concatenation

We use ε-transitions to connect two NFA and create a machine that recognises the concatenation of their languges.

From  Haoran Peng on November 23rd, 2020 0 likes 254 plays 0  

CL - 14d - Regular Languages (II)

We give a second definition of regular language as the languages generated from the empty and singleton languages by the operations of, concatenation, alternation, and iteration.

From  Haoran Peng on November 20th, 2020 0 likes 156 plays 0  

CL - 12f - Cycles

In this video we look at another example, then consider graphs with a cycle of implications. If we have cycles of implications, then all nodes in the cycle must take the same truth value.

From  Haoran Peng on November 9th, 2020 0 likes 284 plays 0  

CL - 12b - Binary Constraints

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…

From  Haoran Peng on November 9th, 2020 0 likes 268 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 - 8e - DPLL I

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…

From  Haoran Peng on November 2nd, 2020 0 likes 308 plays 0  

CL - 8c - Sudoku

First we see how to express the rules of Sudoku in Haskell. Given a total function s :: Int -> Int -> Int -> Bool that represents the way a sudoku puzzle is filled in by saying that s i j k…

From  Haoran Peng on November 1st, 2020 0 likes 330 plays 0  

CL - 5x - Supplementary on Sequents

This video includes a couple of points from a 2019 review lecture on Sequents.First we discuss how to use reduction to find an inhabited model in which Γ ⊨ Δ, which is equivalent to…

From  Haoran Peng on October 30th, 2020 0 likes 15 plays 0