(Preliminary) Course Program

Planning and Reasoning (6CFU)

• Introduction to Planning and Reasoning

• Recap on Propositional Logic

  • Propositional formulas

  • Transition Systems

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

  • Tableaux

  • 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 

• Reasoning about Actions

  • Modeling dynamics of the domain of interest

  • Deliberating and executing actions

  • Action Preconditions, Effects, the Frame Problem

  • Situation Calculus: Precondition Axioms, Successor State Axioms

  • Situation tree 

  • Regression

  • Executability of sequences of actions and Projection (querying a situation resulting from action sequences execution)

  • Golog language for the specification and execution of complex actions in dynamical domains 

  • Learn how to use Prolog to perform reasoning using logic programming