Artificial Intelligence Search Methods for problem Solving

Overview For an autonomous agent to behave in an intelligent manner it must be able to solve problems. This means it should be able to arrive at decisions that transform a given situation into a desired or goal situation. The agent should be able to imagine the consequence of its decisions to be able to identify the ones that work. In this first course on AI we study a wide variety of search methods that agents can employ for problem solving.

Beginner 0(0 Ratings) 0 Students enrolled English
Created by Admin corner
Last updated Wed, 08-Jun-2022
+ View more
Course overview
Curriculum for this course
50 Lessons 27:10:39 Hours
Artificial Intelligence
50 Lessons 27:10:39 Hours
  • Introduction
    Preview 00:33:47
  • Introduction to Knowledge Representation and Reasoning
    00:29:17
  • An Introduction to Formal Logics
    00:31:34
  • Propositional Logic: Language, Semantics and Reasoning
    00:34:47
  • Propositional Logic: Syntax and Truth Values
    00:31:53
  • Propositional Logic: Valid Arguments and Proof Systems
    00:32:41
  • Propositional Logic: Rules of Inference and Natural Deduction
    00:28:33
  • Propositional Logic: Axiomatic Systems and Hilbert Style Proofs
    00:33:44
  • Propositional Logic: The Tableau Method
    00:29:29
  • Propositional Logic: The Resolution Refutation Method
    00:33:15
  • Syntax
    00:34:41
  • Semantics
    00:24:47
  • Entailment and Models
    00:34:04
  • Proof Systems
    00:32:41
  • Forward Chaining
    00:36:48
  • Unification
    00:30:58
  • Forward Chaining Rule Based Systems
    00:30:49
  • The Rete Algorithm
    00:33:00
  • Rete Algorithm - Example
    00:30:59
  • Programming in a Rule Based Language
    00:28:27
  • The OPS5 Expert System Shell
    00:35:11
  • Skolemization
    00:35:22
  • Terminological Facts
    00:29:00
  • Properties and Categories
    00:32:23
  • Reification and Abstract Entities
    00:33:19
  • Resource Description Framework (RDF)
    00:33:42
  • The Event Calculus: Reasoning About Change
    00:36:32
  • Natural Language Semantics
    00:31:36
  • CD Theory
    00:31:03
  • CD Theory (contd)
    00:32:14
  • English to CD Theory
    00:33:03
  • Backward Chaining
    00:36:59
  • Logic Programming
    00:33:28
  • Prolog
    00:38:25
  • Search in Prolog
    00:26:46
  • Controlling Search
    00:32:46
  • The Cut Operator in Prolog
    00:35:37
  • Incompleteness
    00:29:04
  • The Resolution Method for FOL
    00:31:14
  • Clause Form
    00:35:21
  • FOL with Equality
    00:30:23
  • Complexity of Resolution Refutation
    00:40:12
  • Semantic Nets and Frames
    00:34:31
  • Scripts
    00:32:48
  • Applying Scripts
    00:27:26
  • Goals, Plans and Actions
    00:29:36
  • Plan Applier Mechanism
    00:30:31
  • Top Down and Bottom Up Reasoning
    00:31:32
  • Introduction
    00:43:32
  • Normalisation
    00:30:49
+ View more
Other related courses
34:30:27 Hours
Tools in Scientific Computing
Updated Wed, 08-Jun-2022
0 0 Free
20:48:51 Hours
Introduction to R Software
Updated Wed, 08-Jun-2022
0 0 Free
07:24:45 Hours
Introduction to parallel Programming in Open MP
Updated Fri, 10-Jun-2022
0 0 Free
39:26:26 Hours
Design of Digital Circuits and Computer Architecture
Updated Fri, 10-Jun-2022
0 0 Free
About instructor

Admin corner

0 Reviews | 5 Students | 48 Courses
Student feedback
0
0 Reviews
  • (0)
  • (0)
  • (0)
  • (0)
  • (0)

Reviews

Free
Get enrolled
Includes: