Completed
Conflict Resolution
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Artificial Intelligence
Automatically move to the next video in the Classroom when playback concludes
- 1 Prologue
- 2 The Winograd Schema Challenge
- 3 Introduction (2013 version)
- 4 Can Machines Think?
- 5 The Turing Test
- 6 Language and Thought
- 7 The Willing Suspension of Disbelief
- 8 Machines with Wheels and Gears
- 9 The Notion of Mind in Philosophy
- 10 Reasoning = Computation
- 11 Concepts and Categories
- 12 How did AI get its name?
- 13 The Chess Saga
- 14 A Brief History of AI
- 15 The Worlds in our Minds
- 16 Epiphemona in Computers
- 17 State Space Search
- 18 Domain Independent Algorithms
- 19 Deterministic Search
- 20 DFS and BFS
- 21 Comparing DFS and BFS
- 22 Depth First Iterative Deepening
- 23 Heuristic Search
- 24 Heuristic Functions and the Search Landscape
- 25 Solution Space Search
- 26 The Traveling Salesman Problem
- 27 Escaping Local Optima
- 28 Stochastic Local Search
- 29 Genetic Algorithms: Survival of the Fittest
- 30 Genetic Algorithms and SAT
- 31 Genetic Algorithms for the TSP
- 32 Emergent Systems
- 33 Ant Colony Optimization
- 34 Finding Optimal Paths
- 35 Branch & Bound
- 36 Algorithm A*
- 37 A*: An illustrated example
- 38 Is A* Admissible?
- 39 Admissibility of A*
- 40 Higher, Faster ...
- 41 B&B - A* - wA* - Best First
- 42 A*: Leaner Admissible Variations
- 43 The Monotone Condition
- 44 DNA Sequence Alignment
- 45 Divide & Conquer Frontier Search.
- 46 Smart Memory Graph Search
- 47 Variations on A*: The story so far
- 48 Breadth First Heuristic Search
- 49 Beam Stack Search
- 50 Game Theory
- 51 Popular Recreational Games
- 52 Board Games and Game Trees
- 53 The Evaluation Function in Board Games
- 54 Algorithm Minimax and Alpha-Beta Pruning
- 55 A Cluster of Strategies
- 56 SSS*: A Detailed Example
- 57 SSS*: A Best First Algorithm
- 58 Automated Domain Independent Planning
- 59 The Blocks World Domain
- 60 State Space Planning: Forward and Backward
- 61 Goal Stack Planning (GSP)
- 62 GSP: A Detailed Example
- 63 Plan Space Planning (PSP)
- 64 PSP: A Tiny Example
- 65 Multi-Armed Robots
- 66 Means-Ends Analysis
- 67 The Planning Graph
- 68 Algorithm Graphplan
- 69 Problem Decomposition.
- 70 Algorithm AO*
- 71 AO*: An Illustration
- 72 Rete Algorithm: Conflict Resolution
- 73 Rete Algorithm: Optimizing the Match
- 74 The Rete Net
- 75 Business Rule Management Systems
- 76 Conflict Resolution
- 77 The OPS5 Language
- 78 The Inference Engine
- 79 Rule Based Expert Systems
- 80 Reasoning in Logic
- 81 Rules of Inference
- 82 Forward Reasoning
- 83 First Order Logic
- 84 Implicit Quantifier Notation
- 85 Backward Reasoning
- 86 Depth First Search on Goal Trees
- 87 Incompleteness...
- 88 Constraint Satisfaction Problems
- 89 Binary Constraint Networks
- 90 Interpreting Line Drawings
- 91 Model Based Diagnosis
- 92 Solving CSPs
- 93 Arc Consistency
- 94 Propagation = Reasoning
- 95 Lookahead Search
