Artificial Intelligence

Guide to AI and Data Courses · Part I: Core
Intelligent agentsSearchKnowledge and logicUncertaintyPlanningNeighboring courses
Sercan KÜLCÜ · Giresun University · Computer Engineering

Introduction

What Question Does It Ask?

How does a machine act intelligently by searching, reasoning and planning?

Artificial intelligence studies how to design intelligent agents that perceive their environment and choose the action that best serves their goal. The course brings search, logical inference, probabilistic reasoning, planning and learning into one framework. Machine learning is part of that framework, not all of it.

At a glance

Approach

search, logic, probability and learning combined

Input

problem definition: states, actions, goal

Output

action sequence, plan or decision

Success measure

reaching the goal, cost, rationality

Math load

medium: logic, probability, graphs

Data needs

little; often a model and knowledge suffice

Introduction

A Short History

1950

Turing proposes the imitation game (the Turing test) in "Computing Machinery and Intelligence".

1956

Dartmouth summer workshop: the name "artificial intelligence" is coined and the field is born.

1980s

Expert systems (MYCIN, XCON) go commercial; unmet expectations bring an "AI winter".

1997

Deep Blue beats Kasparov at chess: powerful search and a hand-written evaluation.

2016

AlphaGo beats Lee Sedol at Go: tree search, deep networks and reinforcement learning together.

2022

Large language models reach a mass audience through chat interfaces.

The Course

Core Concepts

Intelligent agent

Perceives the environment through sensors, acts on it through actuators.

Rationality

Choosing the action expected to maximize the performance measure.

State-space search

BFS, DFS, A*; heuristic functions.

Adversarial search

Minimax and alpha-beta pruning in games.

Constraint satisfaction

Variables, domains, constraints: Sudoku, timetabling.

Logic and knowledge

Propositional and first-order logic, inference rules.

Uncertainty

Bayes' rule, Bayesian networks, decision theory.

Planning

Building a sequence of actions from start to goal.

The Course

A Typical Workflow

PerceivesensorsRepresentstate,knowledge baseSearch orinfersearch, logic,probabilityChooseperformancemeasureActactuators
Example: A navigation app senses its location, represents the road network as a graph, searches routes with A*, picks the fastest one and guides the driver by voice. Nothing in this loop is "learned"; the system is still AI.

The Course

What Does the Course Cover?

  1. Intelligent agents and types of environments
  2. Uninformed search: BFS, DFS, uniform-cost search
  3. Heuristic search: greedy best-first and A*
  4. Local search: hill climbing, simulated annealing
  5. Adversarial search: minimax and alpha-beta pruning
  6. Constraint satisfaction problems and backtracking
  7. Propositional logic and inference by resolution
  8. First-order logic and knowledge representation
  9. Classical planning: STRIPS and PDDL
  10. Probability, Bayes' rule and Bayesian networks
  11. Decision theory and Markov decision processes
  12. Learning from examples and reinforcement learning

Skills you will gain

formulating problems as state spacesimplementing A* with heuristicslogic programming in Prologwriting planning problems in PDDLbuilding Bayesian networks with pgmpycomparing algorithms by complexity

A typical semester; the order and coverage vary between universities.

Try It

A Warehouse Robot Finds Its Way

A warehouse robot must travel from cell R between the shelves to the item in cell H. Click a cell to add or remove a shelf; compare how many cells the two search methods examine.

Blue cells are states the search examined, orange cells the path found. A* uses the remaining Manhattan distance to the goal as a heuristic, so it looks at fewer cells.
The problem is first set up as a state space: each cell is a state, each move an action, the target cell the goal. The search algorithm finds a path in this space; nothing is learned.

Context

Prerequisites

Courses worth knowing before this one, and why they are needed.

CourseWhy it is needed
Probability and Statisticsreasoning under uncertainty, Bayes rule
Data Structuresstacks, queues, priority queues and graphs: the building blocks of search
Algorithmsgraph search, shortest paths and complexity analysis
Discrete Mathematicspropositional logic, sets and proof techniques

Context

Are You Ready for This Course?

Ask yourself; for every "no", the right-hand column shows where to start.

Ask yourselfIf not, start with
Can you trace BFS and DFS on a graph step by step on paper?Graphs and queues from a data structures course
Can you explain a priority queue and big-O notation?Complexity analysis from an algorithms course
Can you build a truth table with "and", "or" and "implies"?Propositional logic from discrete mathematics
Can you explain conditional probability and Bayes' rule?Probability and Statistics
If you can say "yes" to most of these, you are ready; one or two gaps can be closed during the semester.

Context

Neighbouring Courses

subfieldbuilds onshares methodsapplication

Overlap

Overlapping Courses

RelationCourseShared ground
subfieldMachine Learning is a subfield of this coursean agent that learns from data; statistical generalization instead of search
subfieldNatural Language Processing and Text Mining is a subfield of this courselanguage understanding and generation
subfieldFuzzy Logic and Fuzzy Systems is a subfield of this courseapproximate reasoning
subfieldEvolutionary and Metaheuristic Optimization is a subfield of this courseheuristic search
subfieldExpert Systems and Knowledge Representation is a subfield of this coursesymbolic AI, logic and rules
subfieldMulti-Agent Systems is a subfield of this coursethe agent concept, collective decisions
builds onThis course builds on Probability and Statisticsreasoning under uncertainty, Bayes rule
shares methodsShares methods with Optimizationstate-space search, constraint satisfaction

Differences

Where It Differs (1/2)

CriterionArtificial IntelligenceMachine LearningExpert Systems
Core questionHow does a machine act intelligently by searching, reasoning and planning?How does a program generalize from examples?How is an expert's knowledge written down and used for inference?
Approachsearch, logic, probability and learning combinedstatistical learningsymbolic logic and rules
Inputproblem definition: states, actions, goallabeled or unlabeled examplesfacts and expert rules
Outputaction sequence, plan or decisiona model that makes predictionsconclusion with justification
Success measurereaching the goal, cost, rationalityerror on unseen dataexpert agreement, explainability
Math loadmedium: logic, probability, graphshigh: linear algebra, probability, optimizationlow: propositional and predicate logic
Data needslittle; often a model and knowledge sufficemoderate to largelittle; a knowledge base
  • Machine Learning: AI can find how to reach a goal by search or inference; ML learns the same behavior by generalizing from data.
  • Expert Systems: Expert systems are one approach within AI (rules and logic); AI also covers search, probability and learning.

Differences

Where It Differs (2/2)

CriterionArtificial IntelligenceOptimizationMulti-Agent Systems
Core questionHow does a machine act intelligently by searching, reasoning and planning?How do we find the values that make an objective function best?How do several autonomous agents decide together or against each other?
Approachsearch, logic, probability and learning combinedmathematical model of objective and constraintsinteracting autonomous agents
Inputproblem definition: states, actions, goalobjective function and constraintsagents, goals, protocols
Outputaction sequence, plan or decisionoptimal or near-optimal solutionjoint behavior, equilibrium
Success measurereaching the goal, cost, rationalityobjective value, convergence ratesocial welfare, stability
Math loadmedium: logic, probability, graphsthe theory itselfmedium: game theory
Data needslittle; often a model and knowledge sufficenonelittle; simulation
  • Optimization: Optimization solves a problem already stated mathematically; AI starts by modeling it as agent, environment and goal.
  • Multi-Agent Systems: AI focuses on the decisions of a single agent; multi-agent systems study agents that affect one another.

Practice

Applications

Games

Chess and Go engines, computer opponents in games.

Route planning

Navigation, logistics, paths of warehouse robots.

Scheduling

Class timetables, flight crews and shift plans.

Virtual assistants

Systems that understand speech and turn it into tasks.

Autonomous vehicles

Where perception, prediction and planning meet.

Decision support

Diagnosis suggestions in medicine, fault diagnosis in engineering.

Practice

Risks and Ethics

The wrong performance measure

An agent maximizes its measure literally: a route planner that only minimizes travel time can push traffic onto side streets past schools.

Search that does not scale

State spaces grow exponentially; a search that takes seconds on a toy problem runs out of memory and time at real size.

An incomplete knowledge base

A system that treats whatever is missing from its rules as false draws confident but wrong conclusions from one forgotten rule.

Responsibility for autonomy

When an autonomous car or weapon system decides on its own, it becomes unclear who answers for its mistakes.

In depth: Explainable AI and AI Ethics.

Practice

Tools and Datasets

Tools and libraries

PythonPrologPDDL plannersGoogle OR-ToolsGymnasiumpgmpy (Bayesian networks)

Classic example problems

8-puzzlen-queensSudokuWumpus worldTraveling salesmanChess and Go
An AI course usually gives a problem definition instead of a dataset: once states, actions and the goal are known, the solution is found by search.

Practice

Common Misconceptions

Common beliefIn fact
AI and machine learning are the same thing.ML is a subfield of AI. Search, planning and logic are AI even without learning.
AI aims to think like humans.The course mostly aims at acting rationally; imitating humans is only one approach.
Chess engines learn by playing.Classic engines like Deep Blue use search and a hand-written evaluation; learning is not required.
Chatbots are all of AI.Large language models come from NLP and generative models; AI is a much broader field.

Next Steps

After This Course

Courses that build on or extend this one

Related careers

AI engineerResearcherGame AI developerRobotics software engineerDecision support specialist
AI is the roof of this guide: machine learning, natural language processing, fuzzy logic, evolutionary optimization, expert systems and multi-agent systems are its branches. To decide which branch interests you, a good start is to see this course's search, logic and uncertainty topics first.

Next Steps

Further Reading

  • Russell and Norvig, Artificial Intelligence: A Modern Approach, 4th ed., Pearson, 2020.
  • Poole and Mackworth, Artificial Intelligence: Foundations of Computational Agents, 3rd ed., Cambridge University Press, 2023.
  • Nilsson, The Quest for Artificial Intelligence, Cambridge University Press, 2010 (history of the field).
  • Turing, "Computing Machinery and Intelligence", Mind 59(236), 1950.

The End

Chapter 2: Artificial Intelligence
← Previous chapter · Map of the field · Next chapter →
1 / 1 Sercan KÜLCÜ. All rights reserved.