Artificial Intelligence & Data Science is coming soon
We're still writing and reviewing the notes for every subject, and we'll open it when every subject is ready. Meanwhile you can practise aptitude, ask Aria about any subject, or see the branches that are ready.
Artificial Intelligence & Data Science
Artificial Intelligence
Agents, uninformed and heuristic search, game search and CSPs, logic and inference, planning.
Your progress in this subject0 of 2 · 0%
- 1Alpha-beta pruningAlpha–beta pruning speeds up minimax search in two-player, zero-sum, perfect-information games by cutting branches that cannot affect the final decision.
- 2Constraint satisfaction problemsConstraint satisfaction problems (CSPs) formalise many engineering design and scheduling tasks: they are solved by search plus constraint propagation (arc consistency, forward checking, MAC) and by exploiting structure (tree-structured CSPs).
Coming next in Artificial Intelligence
- What AI is and its history· notes coming
- Narrow, general and super AI· notes coming
- Intelligent agents and environments· notes coming
- Rationality and task environments· notes coming
- Structure of agents· notes coming
- State space representation· notes coming
- Problem-solving agents· notes coming
- Uninformed search: BFS, DFS and uniform cost· notes coming
- Informed search: greedy and A*· notes coming
- Heuristic functions· notes coming
- Local search: hill climbing and simulated annealing· notes coming
- Minimax and optimal decisions in games· notes coming
- Monte Carlo tree search· notes coming
- Stochastic and partially observable games· notes coming
- Constraint propagation and backtracking· notes coming
- Knowledge-based agents and the wumpus world· notes coming
- Propositional logic and theorem proving· notes coming
- First-order logic· notes coming
- Unification· notes coming
- Forward and backward chaining· notes coming
- Resolution· notes coming
- Classical planning· notes coming
- Hierarchical planning and planning under uncertainty· notes coming
- Generative AI· notes coming
- Explainable AI· notes coming
- Federated learning and edge AI· notes coming
- Approaches to knowledge representation· notes coming
- Procedural and declarative knowledge· notes coming
- Bayesian networks· notes coming
- Dempster-Shafer theory· notes coming
- Fuzzy sets and fuzzy logic· notes coming
- Goal stack planning· notes coming
- Inference and entailment· notes coming
- Rule-based systems and production rules· notes coming
- Non-monotonic reasoning and default logic· notes coming
- Semantic networks and frames· notes coming
- Description logic· notes coming
- Conceptual dependency and scripts· notes coming
- Ontologies· notes coming
- Iterative deepening search· notes coming
- Branch and bound search· notes coming
- Beam search and tabu search· notes coming
- Evaluation functions· notes coming
- Learning from observation and inductive learning· notes coming
- Types of machine learning· notes coming
- Applications of AI· notes coming
- Problem reduction and AND-OR graphs· notes coming
- Exact and approximate inference in Bayesian networks· notes coming
- Expert systems and knowledge engineering· notes coming
- Bidirectional and depth-limited search· notes coming
- Generate-and-test and means–ends analysis· notes coming
- Knowledge graphs: RDF, RDFS and OWL· notes coming
- Commonsense, qualitative and case-based reasoning· notes coming