Planning as Satisfiability: Parallel Plans and Algorithms for Plan Search

    Research output: Working paperProfessional

    Original languageEnglish
    Place of PublicationFreiburg, Germany
    PublisherAlbert-Ludwigs-Universität Freiburg
    Number of pages56
    Publication statusPublished - 2004
    MoE publication typeD4 Published development or research report or study

    Publication series

    NameTechnical Reports of the Institute of Computer Science at Freiburg University
    No.216

    Keywords

    • planning
    • propositional logic
    • satisfiability testing

    Cite this

    Rintanen, J., Heljanko, K., & Niemelä, I. (2004). Planning as Satisfiability: Parallel Plans and Algorithms for Plan Search. (Technical Reports of the Institute of Computer Science at Freiburg University; No. 216). Freiburg, Germany: Albert-Ludwigs-Universität Freiburg.