TCS / Research / Publications / Planning as Satisfiability: Parallel Plans and Algorithms for Plan Search
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

Planning as Satisfiability: Parallel Plans and Algorithms for Plan Search

Reference:

Jussi Rintanen, Keijo Heljanko, and Ilkka Niemelä. Planning as satisfiability: Parallel plans and algorithms for plan search. Technical Report 216, Institute of Computer Science, University of Freiburg, Freiburg, Germany, 2005.

Suggested BibTeX entry:

@techreport{RinHelNie:TR216,
    address = {Freiburg, Germany},
    author = {Jussi Rintanen and Keijo Heljanko and Ilkka Niemel{\"a}},
    institution = {Institute of Computer Science, University of Freiburg},
    number = {216},
    pages = {56},
    title = {Planning as Satisfiability: Parallel Plans and Algorithms for Plan Search},
    type = {Technical Report},
    year = {2005},
}

See www.informatik.uni-freiburg.de ...

[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links]
Latest update: 19 January 2010.