Institute of Theoretical Informatics, Algorithm Engineering

PASAR – Planning as Satisfiability with Abstraction Refinement

  • Subject:Automated Planning, SAT Solving, Heuristic Search
  • Type:Masterarbeit
  • Date:September 2019
  • Supervisor:

    Tomáš Balyo, Dominik Schreiber

  • Student:

    Nils Froleyks