Edit course information: Problem Solving and Search in Artificial Intelligence (SS2021)

Du bist aus dem folgenden Grund nicht berechtigt, diese Seite bearbeiten:

Diese Aktion ist auf Benutzer beschränkt, die der Gruppe „Benutzer“ angehören.

Course description

Title:	Advanced Problem Solving and Search Name of the lecture, in the language of the lecture
Research group:	Research groups offering this lecture; use Ctrl+click to select multiple groups
Lecturers:	List of lecturers, separated by semicolon
Tutors:	List of exercise tutors, separated by semicolon
Term:	Semester of this lecture; for winter semesters, the start year is used, e.g., WS 2014 for WS 2014/2015
Lecture series:	List of lecture series this lecture belongs to
Matrix channel:	Matrix channel associated with the course, e.g., `#example:example.org`
Modules:	Associated module ids, separated by commas
SWS:	// SWS for lectures/exercises/practicals
Type of examination:	Klausur mündliche Prüfung Hausarbeit Referat nach Modulbeschreibung Type(s) of examination; could be more than one; documentation of possible values
Description:	Problem solving and search is a central topic in Artificial Intelligence. This course presents several techniques to solve in general difficult problems. The course covers the following '''topics''': Basic Concepts Uninformed vs Informed Search Local Search, Stochastic Hill Climbing, Simulated Annealing Tabu Search Answer Set Programming Constraint Satisfaction Evolutionary Algorithms, Genetic Algorithms Structural Decomposition Techniques (Tree/Hypertree Decompositions) The course does not cover topics in the area of Machine Learning and Neural Networks. NOTE: This course was previously named Problem Solving and Search in Artificial Intelligence. The contents of former PSSAI and APSS are identical, and therefore students can only take one of the two courses. ===Learning Outcomes=== The students should identify why typical AI problems are difficult to solve The students will analyze different algorithms and methods for AI problems and identify when their application is appropriate The connections between the (graph) structure and the complexity of a problem should become clear, as well as which methods can be used to tackle the problem In the tutorials, the students will analyze different problems and develop solutions for them. ===Prerequisites=== Basic knowledge of theoretical computer science and Logic. Good English skills: both the teaching and examination will be exclusively in English. ===Organisation=== The goals can be acquired by studying the lecture material and solving the exercises of the tutorials. The lectures will be held on Mondays DS2 (09.20 - 10.50 am) and the tutorials on Tuesdays DS2. Please check the schedule for changes. The slides of the lectures and exercises of the tutorials will be uploaded in this page, in each corresponding session. <b>Announcement:</b> because of the COVID-19 pandemic we will provide the materials for self-learning on the planned dates for lectures and we will have online live sessions for the tutorials. The lecture videos will be uploaded in OPAL and I invite you to use the forum to ask questions and share your exercise solutions. Please, register for the course on the OPAL site: https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/29670014985?6 ===Examination=== This year, due to the exceptional COVID-19 pandemic, the exam will be written and online, on the OPAL-ONYX platform. It will mostly consist of single and multiple-choice questions as well as some quick exercises. There will be no oral examinations. As a consequence, regarding complex examinations held jointly with another examiner: - Students who wish to take a complex examination jointly with another examiner need to look for the main examiner. Due to the large number of registered students in PSSAI, I kindly request you to find another main examiner. - In principle, PSSAI will only offer separate partial examinations (Teilprüfungen) this semester. Please follow this link to get the instructions for the examination: https://iccl.inf.tu-dresden.de/w/images/c/c0/Examination.pdf Description of topics and goals.
Literature:	Stuart J. Russell and Peter Norvig. "Artificial Intelligence A Modern Approach" (3. edition ). Pearson Education, 2010. Zbigniew Michalewicz and David B. Fogel. "How to Solve It: Modern Heuristics", volume 2. Springer, 2004. Martin Gebser, Benjamin Kaufmann Roland Kaminski, and Torsten Schaub. "Answer Set Solving in Practice". Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan and Claypool Publishers, 2012. Michael Gelfond and Vladimir Lifschitz. "Classical negation in logic programs and disjunctive databases". New Generation Comput., 9(3–4):365–386, 1991. A.E. Eiben and J.E. Smith. "Introduction to Evolutionary Computing", Springer, 2003. Thomas Hammerl, Nysret Musliu and Werner Schafhauser. "Metaheuristic Algorithms and Tree Decomposition", Handbook of Computational Intelligence, pp 1255–1270, Springer, 2015. Hans L. Bodlaender, Arie M.C.A. Koster. "Treewidth computations I. Upper bounds", Comput. 208(2): 259–275, 2010. Georg Gottlob, Nicola Leone, and Francesco Scarcello. "Hypertree decompositions and tractable queries", Journal of Computer and System Sciences, 64(3):579–627, 2002. ISSN 0022-0000. Artan Dermaku, Tobias Ganzow, Georg Gottlob, Ben McMahan, Nysret Musliu, and Marko Samer. "Heuristic methods for hypertree decomposition", In Alexander Gelbukh and Eduardo F. Morales, editors, MICAI 2008: Advances in Artificial Intelligence, volume 5317 of LNCS, pages 1–11. Springer Berlin Heidelberg, 2008. ISBN 978-3-540-88635-8. Literature list (free text), use "" at the start of lines to create bulleted lists

Dates of lectures and exercises

	Introduction
Room:	Date and time: Room can also be an external link, which will display as “Video conference”; use “terminlos” as DS for sessions that don't have precise dates, e.g., multiple exercise sessions
Downloads:	Datei hochladen
Links to videos:	Links to (possibly external, e.g., YouTube-hosted) videos

	Informed vs. Uninformed Search
Room:	Date and time: Room can also be an external link, which will display as “Video conference”; use “terminlos” as DS for sessions that don't have precise dates, e.g., multiple exercise sessions
Downloads:	Datei hochladen
Links to videos:	Links to (possibly external, e.g., YouTube-hosted) videos

	Local Search
Room:	Date and time: Room can also be an external link, which will display as “Video conference”; use “terminlos” as DS for sessions that don't have precise dates, e.g., multiple exercise sessions
Downloads:	Datei hochladen
Links to videos:	Links to (possibly external, e.g., YouTube-hosted) videos

	Tutorial 1 (Local Search)
Room:	Date and time: Room can also be an external link, which will display as “Video conference”; use “terminlos” as DS for sessions that don't have precise dates, e.g., multiple exercise sessions
Downloads:	Datei hochladen
Links to videos:	Links to (possibly external, e.g., YouTube-hosted) videos

	Tabu Search
Room:	Date and time: Room can also be an external link, which will display as “Video conference”; use “terminlos” as DS for sessions that don't have precise dates, e.g., multiple exercise sessions
Downloads:	Datei hochladen
Links to videos:	Links to (possibly external, e.g., YouTube-hosted) videos

	Tutorial 2 (Tabu Search)
Room:	Date and time: Room can also be an external link, which will display as “Video conference”; use “terminlos” as DS for sessions that don't have precise dates, e.g., multiple exercise sessions
Downloads:	Datei hochladen
Links to videos:	Links to (possibly external, e.g., YouTube-hosted) videos

	ASP 1
Room:	Date and time: Room can also be an external link, which will display as “Video conference”; use “terminlos” as DS for sessions that don't have precise dates, e.g., multiple exercise sessions
Downloads:	Datei hochladen
Links to videos:	Links to (possibly external, e.g., YouTube-hosted) videos

	Tutorial 3 (ASP 1)
Room:	Date and time: Room can also be an external link, which will display as “Video conference”; use “terminlos” as DS for sessions that don't have precise dates, e.g., multiple exercise sessions
Downloads:	Datei hochladen
Links to videos:	Links to (possibly external, e.g., YouTube-hosted) videos

	ASP 2
Room:	Date and time: Room can also be an external link, which will display as “Video conference”; use “terminlos” as DS for sessions that don't have precise dates, e.g., multiple exercise sessions
Downloads:	Datei hochladen
Links to videos:	Links to (possibly external, e.g., YouTube-hosted) videos

	Tutorial 4 (ASP 2)
Room:	Date and time: Room can also be an external link, which will display as “Video conference”; use “terminlos” as DS for sessions that don't have precise dates, e.g., multiple exercise sessions
Downloads:	Datei hochladen
Links to videos:	Links to (possibly external, e.g., YouTube-hosted) videos

	ASP 3
Room:	Date and time: Room can also be an external link, which will display as “Video conference”; use “terminlos” as DS for sessions that don't have precise dates, e.g., multiple exercise sessions
Downloads:	Datei hochladen
Links to videos:	Links to (possibly external, e.g., YouTube-hosted) videos

	CSP
Room:	Date and time: Room can also be an external link, which will display as “Video conference”; use “terminlos” as DS for sessions that don't have precise dates, e.g., multiple exercise sessions
Downloads:	Datei hochladen
Links to videos:	Links to (possibly external, e.g., YouTube-hosted) videos

	Tutorial 5 (CSP)
Room:	Date and time: Room can also be an external link, which will display as “Video conference”; use “terminlos” as DS for sessions that don't have precise dates, e.g., multiple exercise sessions
Downloads:	Datei hochladen
Links to videos:	Links to (possibly external, e.g., YouTube-hosted) videos

	Evolutionary Algorithms
Room:	Date and time: Room can also be an external link, which will display as “Video conference”; use “terminlos” as DS for sessions that don't have precise dates, e.g., multiple exercise sessions
Downloads:	Datei hochladen
Links to videos:	Links to (possibly external, e.g., YouTube-hosted) videos

	Tutorial 6 (EA 1)
Room:	Date and time: Room can also be an external link, which will display as “Video conference”; use “terminlos” as DS for sessions that don't have precise dates, e.g., multiple exercise sessions
Downloads:	Datei hochladen
Links to videos:	Links to (possibly external, e.g., YouTube-hosted) videos

	Structural Decompositions 1
Room:	Date and time: Room can also be an external link, which will display as “Video conference”; use “terminlos” as DS for sessions that don't have precise dates, e.g., multiple exercise sessions
Downloads:	Datei hochladen
Links to videos:	Links to (possibly external, e.g., YouTube-hosted) videos

	Tutorial 7 (Structural Decompositions)
Room:	Date and time: Room can also be an external link, which will display as “Video conference”; use “terminlos” as DS for sessions that don't have precise dates, e.g., multiple exercise sessions
Downloads:	Datei hochladen
Links to videos:	Links to (possibly external, e.g., YouTube-hosted) videos

	Structural Decompositions 2
Room:	Date and time: Room can also be an external link, which will display as “Video conference”; use “terminlos” as DS for sessions that don't have precise dates, e.g., multiple exercise sessions
Downloads:	Datei hochladen
Links to videos:	Links to (possibly external, e.g., YouTube-hosted) videos

	Tutorial 8 (Structural Decompositions 2)
Room:	Date and time: Room can also be an external link, which will display as “Video conference”; use “terminlos” as DS for sessions that don't have precise dates, e.g., multiple exercise sessions
Downloads:	Datei hochladen
Links to videos:	Links to (possibly external, e.g., YouTube-hosted) videos

	Q&A
Room:	Date and time: Room can also be an external link, which will display as “Video conference”; use “terminlos” as DS for sessions that don't have precise dates, e.g., multiple exercise sessions
Downloads:	Datei hochladen
Links to videos:	Links to (possibly external, e.g., YouTube-hosted) videos

Weitere hinzufügen

Zusammenfassung:

Abbrechen