Download Applied Informatics

Title
Artificial Intelligence
Code
Compulsory/Elective
module
Instructor(s)
Language
Aim
Course Contents
Assessment
Recommended
Reading
Supplemental
material
1st week
2nd week
3rd week
4th week
5th week
6th week
7th week
8th week
9th week
10th week
11th week
12th week
13th week
Year
3
Semester
6
Compulsory
Ioannis Refanidis
English
To be able to: (a) model search problems and use suitable search algorithms to
solve them; (b) represent knowledge and reason over it; (c) model and solve
planning problems.
Intelligent agents.
Search algorithms. Blind search and informed search.
Constraint satisfaction problems. Arc consistency. Constraint propagation.
Adversary games. Minimax search and alpha-beta pruning. Games with chance.
Knowledge and reasoning. Propositional logic. First order logic. Resolution.
Ontologies. Semantic web.
Planning. STRIPS representation. Progression and Regression. Partial order
planning. Temporal planning and planning with resources.
Final exams (80%)
Home projects (20%)
Artificial Intelligence, a modern approach (English or Greek)
by Stuart Russell and Peter Norvig, published by Prentice Hall (International
edition, 2009) and Kleidarithmos (Greek edition, 2004) ISBN: 0136042597 (3rd
edition, English), 960-209-873-2 (2nd edition, Greek)
Artificial Intelligence (Greek only), by Ioannis Vlahavas, Petros Kefalas, Nick
Bassiliades, Fotis Kokkoras and Ilias Sakellariou published by University of
Macedonia Press, 2011.
ISBN: 9789608396647
Lectures slides. Solved exercises.
What is Artificial Intelligence (AI). History of AI. Modern AI. Intelligent agents.
Rationality. Environments. Agent structure.
Problem solving agent. Problems and solutions. Search tree. Measuring the
efficiency of algorithms. Uninformed search algorithms: breadth-first search,
uniform cost search, depth-first search, iterative deepening, bidirectional search.
Avoiding repeated states.
Informed search. Best-first search. Α* search. Admissible heuristic functions.
Inventing heuristic functions.
Local search algorithms: Hill climbing. Simulated annealing.
Implementing search algorithms in C. Case study: the N-puzzle.
Constraint satisfaction problems. Backtracking search. Information propagation
through constraints. Arc consistency. Variable and value ordering. Solving
constraint satisfaction problems using local search.
Two-player games. The minimax algorithm. Alpha-beta pruning. Chance games.
Case study: Backgammon. Card games.
Logical agents. The wumpus world. Logic. Propositional logic. Inference patterns
in propositional logic: Modus ponens. The resolution method. Horn clauses.
Efficient propositional inference.
First order logic. Syntax and semantics. The relatives domain. The wumpus
worls. Unification and elevation. Forward/backward chaining. Resolution.
Ontologies. Ontological engineering. Classes and obkects. Semantic web.
RDF/RDFS. The Protégé ontology editor.
Planning. The STRIPS language. State-space planning. Progession / regression.
Heuristic functions. Partial order planning. Time, schedules, resources.
Philosophical foundations of Artificial Intelligence. AI: Present and Future.