|
|
|
Third video of the Inf2D Reasoning and Agents lecture on Logical Agents.
Course Code
INFR08010 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
Lecture 3 part 3
Course Code
PHIL10064 Licence Type
Creative Commons - Attribution Date Created
January 24th, 2021
|
|
This is the second lecture video of Intelligent Agents and their Environments, presenting a taxonomy of agents based on their structure.
Course Code
INFR08010 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
N/A
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
This is the last FP video lecture, on Propositions as Types.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
We use ε-transitions to connect two NFA and create a machine that recognises the concatenation of their languges.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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.
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
|
|
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.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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.
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
|
|
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…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|