
Course Overview
AI – Artificial Intelligence (Theory)
- Introduction
- Application of AI
- History of AI
- Types of AI
- Intelligent Agent
- Types of Agent
- Environment
- Turing Text
- Problem Solving
- Search Algorithms
- Uniformed Search Algorithms
- Hill Climbing Algorithm
- Means-Ends Analysis
- Adversarial Search
- Minimax Algoritham
- Alpha-beta Pursing
- Knowledge Represent
- Agent
- Representation
- Techniques
- Logic
- Rules of Inference
- First-order logic
- Knowledge engineering in FOL (First order Logic)
- Inference in FOL
- Unification in FOL
- Resolution in FOL
- Forward Chaining and Backward Chaining
- Reasoning in AI
- Probabilistic Reasoning in AI
- Bayes theorem in AI
- Bayesian Belief Network
- Subsets of AI
- Machine Learning
- Deep Learning
- Natural Language processing
- Expert System
- Robotics
- Machine Vision
- Speech Recognition
Prolog – practical (Prolog is a logical and a declarative programming language.)
- How to Run Prolog
- Sample Programs
- Map colorings
- Two factorial definitions
- Towers of Hanoi puzzle
- Loading programs, editing programs
- Negation as failure
- Tree data and relations
- Prolog lists and sequences
- Change for a dollar
- Map coloring redux
- Simple I/O
- Chess queens challenge puzzle
- Finding all answers
- Truth table maker
- DFA parser
- Graph structures and paths
- Search
- Animal identification game
- Clauses as data
- Actions and plans
- How Prolog Works
- Prolog derivation trees, choices and unification
- Cut
- Meta-interpreters in Prolog
- Built-in Goals
- Utility goals
- Universals (true and fail)
- Loading Prolog programs
- Arithmetic goals
- Testing types
- Equality of Prolog terms, unification
- Control
- Testing for variables
- Assert and retract
- Binding a variable to a numerical value
- Procedural negation, negation as failure
- Input/output
- Prolog terms and clauses as data
- Prolog operators
- Finding all answers
- Search in Prolog
- The A* algorithm in Prolog
- The 8-puzzle
- αβ search in Prolog …
- Logic Topics
- Chapter 6 notes
- Positive logic
- Convert first-order logic to normal form
- A normal rulebase goal interpreter
- Evidentiary soundness and completeness
- Rule tree visualization
- Introduction to Natural Language Processing
- Prolog grammar parser generator
- Prolog grammar for simple English phrase structures
- Idiomatic natural language command and question interfaces
Curriculum is empty
0.00 average based on 0 ratings
5 Star
0%
4 Star
0%
3 Star
0%
2 Star
0%
1 Star
0%