""

Participation

Please register for the course to gain access to the Adam workspace.

Lecture Slides

No.TopicDateSlides
A1Organizational Matters16.09.printer
handout
screen
A2What is Planning?16.09.printer
handout
screen
A3Getting to Know a Planner21.09.printer
handout
screen
B1Transition Systems and Propositional Logic21.09.printer
handout
screen
B2Planning and Optimization23.09.printer
handout
screen
B3Formal Definition of Planning23.09.printer
handout
screen
B4Equivalent Operators and Normal Forms28.09.printer
handout
screen
B5Positive Normal Form and STRIPS28.09.printer
handout
screen
B6Computational Complexity of Planning: Background30.09.printer
handout
screen
B7Computational Complexity of Planning: Results30.09.printer
handout
screen
 All slides (up to and including B7) printer
handout
screen

Extra Material

No.TitleFiles
B7Tom Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2), pp. 165-204, 1994.PDF
B7Hayyan Helal and Gerhard Lakemeyer. Simple Numeric Planning with Two Variables is Decidable. Proc. ECAI 2025, pp. 4881-4888, 2025.PDF
Nach oben