(Preliminary) Course Program

Planning and Reasoning (6 CFU)

• Introduction to Planning and Reasoning

• Recap on Propositional Logic

  • Propositional formulas

  • Transition Systems

  • Evaluation (Model Checking), Satisfiability, Validity, Logical Implication

  • DPLL, SAT solvers

• Recap on First-Order Logic

  • First-Order Logic Formulas

  • Evaluation in First-Order Logic

  • Reasoning in First-Order Logic

  • Tableaux

• State-Space and Plan-based Search

  • Forward Search

  • Backward Search

  • Heuristic Search: Best-first, A*

  • Heuristics for classical planning based on delete relaxation, abstraction, landmarks 

• Planning in Deterministic Domains

  • Deterministic Planning Domains

  • Computational Complexity of Planning 

  • STRIPS, ADL, Planning Domain Description Language (PDDL)

  • Overview of Classical Planning Algorithms 

  • Getting to Know and Use a Planner 

• Temporal Planning

  • Durative actions in PDDL 2.1/2.2, concurrency and required concurrency, temporal constraints and Simple Temporal Networks (STN/STP), overview of temporal planners (e.g., OPTIC).

• Diverse Planning

  • Theory, algorithms, and variants (Top K, Top Quality, Diverse)

  • Laboratory: ForbidIterative, K*, SymK

• GenAI and Planning

  • LLMs as planners (plan generation, post-training and inference-time methods, limits as standalone planners)

  • Hybrid LLM&Symbolic approaches (LLM-to-PDDL model acquisition, plan validation and repair with a planner in the loop)

• Probabilistic Planning

  • Heuristic search for MDPs, Monte Carlo methods (UCT/MCTS, POMCP), PPDDL and RDDL

  • Laboratory: Probabilistic Planning with RDDL and PyRDDLGym