Advanced Problem Solving and Search
Aus International Center for Computational Logic
Advanced Problem Solving and Search
Lehrveranstaltung mit SWS 2/2/0 (Vorlesung/Übung/Praktikum) im WS 2025
Dozent
Tutor
Umfang (SWS)
- 2/2/0
Module
- CMS-CE-EL1
- CMS-CE-EL2
- CMS-CLS-ELG
- CMS-CLS-ELV
- CMS-COR-FAI
- CMS-EE-EL1
- CMS-EE-EL2
- CMS-VC-ELV2
- INF-25-MA-FTK-APSS
- INF-BAS2
- INF-VERT2
- MCL-AI
- MCL-KR
- MCL-PI
Leistungskontrolle
- nach Modulbeschreibung
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
- Evolutionary Algorithms, Genetic Algorithms
- Answer Set Programming
- Constraint Satisfaction Problems
- 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: teaching will be exclusively in English.
Organisation
The goals can be acquired by studying the lecture material and solving the exercises of the tutorials.
The slides of the lectures and exercises of the tutorials will be uploaded in OPAL, for each corresponding session. We 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/51227885574
Registration to tutorial groups will be possible in OPAL after the first lecture on 14th October 2025.
Exam
Key information: There are two forms of examination depending on your study program:
Students of the CMS Master, exchange students and students in the Computer Science Master:
- There will be a written exam. Dates and information will follow during the semester. There is no possibility to take the exam remotely.
- You must register in Selma or with your examination office.
Students with complex examinations:
- Please, schedule your oral exams with our secretary (cl@tu-dresden.de) after registering in Selma.
- 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.
Veranstaltungskalender abonnieren (icalendar)
… weitere Ergebnisse| Vorlesung | Introduction | DS2, 14. Oktober 2025 in GÖR/0226/H | |
| Vorlesung | Informed vs. Uniformed Search | DS2, 21. Oktober 2025 in GÖR/0226/H | |
| Übung | Tutorial Gr-Thu1 1 (Traditional Search) | DS4, 23. Oktober 2025 in APB E007 | |
| Übung | Tutorial Gr-Mo2 1 (Traditional Search) | DS4, 27. Oktober 2025 in APB E001 | |
| Übung | Tutorial Gr-Mo3 1 (Traditional Search) | DS5, 27. Oktober 2025 in APB E008 | |
| Übung | Tutorial Gr-Mo4 1 (Traditional Search) | DS6, 27. Oktober 2025 in APB E001 | |
| Vorlesung | Local Search | DS2, 28. Oktober 2025 in GÖR/0226/H | |
| Übung | Tutorial Gr-Thu1 2 (Local Search) | DS4, 30. Oktober 2025 in APB E007 | |
| Übung | Tutorial Gr-Mo2 2 (Local Search) | DS4, 3. November 2025 in APB E001 | |
| Übung | Tutorial Gr-Mo3 2 (Local Search) | DS5, 3. November 2025 in APB E008 | |
| Übung | Tutorial Gr-Mo4 2 (Local Search) | DS6, 3. November 2025 in APB E001 | |
| Vorlesung | Tabu Search | DS2, 4. November 2025 in GÖR/0226/H | |
| Übung | Tutorial Gr-Thu1 3 (Tabu Search) | DS4, 6. November 2025 in APB E007 | |
| Übung | Tutorial Gr-Mo2 3 (Tabu Search) | DS4, 24. November 2025 in APB E001 | |
| Übung | Tutorial Gr-Mo3 3 (Tabu Search) | DS5, 24. November 2025 in APB E008 | |
| Übung | Tutorial Gr-Mo4 3 (Tabu Search) | DS6, 24. November 2025 in APB E001 | |
| Vorlesung | Evolutionary Algorithms | DS2, 25. November 2025 in GÖR/0226/H | |
| Übung | Tutorial Gr-Thu1 4 (EA) | DS4, 27. November 2025 in APB E007 | |
| Übung | Tutorial Gr-Mo2 4 (EA) | DS4, 1. Dezember 2025 in APB E001 | |
| Übung | Tutorial Gr-Mo3 4 (EA) | DS5, 1. Dezember 2025 in APB E008 | |
| Übung | Tutorial Gr-Mo4 4 (EA) | DS6, 1. Dezember 2025 in APB E001 | |
| Vorlesung | ASP I | DS2, 2. Dezember 2025 in GÖR/0226/H | |
| Übung | Tutorial Gr-Thu1 5 (ASP I) | DS4, 4. Dezember 2025 in APB E007 | |
| Übung | Tutorial Gr-Mo2 5 (ASP I) | DS4, 8. Dezember 2025 in APB E001 | |
| Übung | Tutorial Gr-Mo3 5 (ASP I) | DS5, 8. Dezember 2025 in APB E008 | |
| Übung | Tutorial Gr-Mo4 5 (ASP I) | DS6, 8. Dezember 2025 in APB E001 | |
| Vorlesung | ASP II | DS2, 9. Dezember 2025 in GÖR/0226/H | |
| Übung | Tutorial Gr-Thu1 6 (ASP II) | DS4, 11. Dezember 2025 in APB E007 | |
| Übung | Tutorial Gr-Mo2 6 (ASP II) | DS4, 15. Dezember 2025 in APB E001 | |
| Übung | Tutorial Gr-Mo3 6 (ASP II) | DS5, 15. Dezember 2025 in APB E008 | |
| Übung | Tutorial Gr-Mo4 6 (ASP II) | DS6, 15. Dezember 2025 in APB E001 | |
| Vorlesung | ASP III | DS2, 16. Dezember 2025 in GÖR/0226/H | |
| Übung | Tutorial Gr-Thu1 7 (ASP III) | DS4, 18. Dezember 2025 in APB E007 | |
| Übung | Tutorial Gr-Mo2 7 (ASP III) | DS4, 5. Januar 2026 in APB E001 | |
| Übung | Tutorial Gr-Mo2 7 (ASP III) | DS5, 5. Januar 2026 in APB E008 | |
| Übung | Tutorial Gr-Mo4 7 (ASP III) | DS6, 5. Januar 2026 in APB E001 | |
| Vorlesung | CSP | DS2, 6. Januar 2026 in GÖR/0226/H | |
| Übung | Tutorial Gr-Thu1 8 (CSP) | DS4, 8. Januar 2026 in APB E007 | |
| Übung | Tutorial Gr-Mo2 8 (CSP) | DS4, 12. Januar 2026 in APB E001 | |
| Übung | Tutorial Gr-Mo3 8 (CSP) | DS5, 12. Januar 2026 in APB E008 | |
| Übung | Tutorial Gr-Mo4 8 (CSP) | DS6, 12. Januar 2026 in APB E001 | |
| Vorlesung | Structural Decompositions I | DS2, 13. Januar 2026 in GÖR/0226/H | |
| Übung | Tutorial Gr-Thu1 9 (TD I) | DS4, 15. Januar 2026 in APB E007 | |
| Übung | Tutorial Gr-Mo2 9 (TD I) | DS4, 19. Januar 2026 in APB E001 | |
| Übung | Tutorial Gr-Mo3 9 (TD I) | DS5, 19. Januar 2026 in APB E008 | |
| Übung | Tutorial Gr-Mo4 9 (TD I) | DS6, 19. Januar 2026 in APB E001 | |
| Vorlesung | Structural Decompositions II | DS2, 20. Januar 2026 in GÖR/0226/H | |
| Übung | Tutorial Gr-Thu1 10 (TD II) | DS4, 22. Januar 2026 in APB E007 | |
| Übung | Tutorial Gr-Mo2 10 (TD II) | DS4, 26. Januar 2026 in APB E001 | |
| Übung | Tutorial Gr-Mo3 10 (TD II) | DS5, 26. Januar 2026 in APB E008 |
Kalender
