Artificial and Computational Intelligence
#
Modular Structure
#
1. Introduction
#
- Artificial Intelligence foundations
- Overview of modern AI
- AI application domains
2. Introduction to Intelligent Agents
#
- Notion of agents and environments
- Rationality
- Nature of environments
- Structure of agents
3. Problem-Solving Agents Using Search
#
- Problem formulation
- Uninformed and informed search algorithms
- Heuristics
- Greedy Best-First Search
- A* Search and optimality of A*
- Heuristic accuracy and algorithm performance
- Admissible heuristics from relaxed problems
- Pattern databases and experience
- Learning heuristics
- Local search and optimisation
- Hill Climbing
- Local Beam Search
- Genetic Algorithms
- Ant Colony Optimisation
- Neural Architecture Search
- Neuroevolution
4. Game Playing
#
- Minimax Algorithm
- Alpha-Beta Pruning
- Monte Carlo Tree Search
- Stochastic Games
5. Knowledge Representation Using Logic
#
- Propositional and Predicate Logic
- TT-Entail and theorem proving
- Logic representation of intelligent agents
- Proof by resolution
- DPLL Algorithm
- Agents based on Propositional Logic
- Unification
- Forward Chaining
- Backward Chaining
- Resolution
6. Multi-Agent Decision Making
#
- Properties of multi-agent environments
- Multi-agent planning
- Non-Cooperative Game Theory
- Cooperative Game Theory
- Collective decision making
7. Probabilistic Representation and Reasoning
#
- Representing knowledge in uncertain domains
- Semantics of Bayesian Networks
- Exact inference in Bayesian Networks
- Approximate inference in Bayesian Networks
8. Probabilistic Reasoning Over Time
#
- Time and uncertainty
- Inference in temporal models
- Hidden Markov Models
- Learning HMMs
- Dynamic Bayesian Networks
9. Ethics in AI
#
- Explainable AI
- Logically Explained Networks
- Explainable Bayesian Networks
Experiments
#
| # | Experiment |
|---|
| 1 | Implement Uninformed Search Algorithms such as BFS and DFS |
| 2 | Implement the A* Algorithm for Informed Search |
| 3 | Implement Local Search Techniques using a Genetic Algorithm |
| 4 | Implement the Minimax Algorithm for Adversarial Search in game playing |
| 5 | Represent knowledge using logic and perform reasoning using Prolog |
| 6 | Experiment with Bayesian Networks and exact inference |
| 7 | Experiment with the application of a Hidden Markov Model in Natural Language Processing |
- Programming languages: Python, Prolog
- Tools and libraries: Jupyter, NumPy, SciPy, Pandas, pgmpy, NLTK
- Environments: Google Colab, SWI-Prolog Online
Book References
#
Primary Textbook
#
- Stuart Russell and Peter Norvig, Artificial Intelligence: A Modern Approach, 4th Edition, Pearson Education, 2020.
Reference Books
#
- Ryszard S. Michalski, Jaime G. Carbonell and Tom M. Mitchell, Machine Learning: An Artificial Intelligence Approach, Elsevier, 2014.
- Dan W. Patterson, Introduction to AI and Expert Systems, Prentice Hall of India, New Delhi, 2010.
- Elaine Rich and Kevin Knight, Artificial Intelligence, 2nd Edition, Tata McGraw Hill Publishing Company, New Delhi, 2003.
Home | Artificial Intelligence