TCS / Research / Publications / Parallel Encodings of Classical Planning as Satisfiability
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

Parallel Encodings of Classical Planning as Satisfiability

Reference:

Jussi Rintanen, Keijo Heljanko, and Ilkka Niemelä. Parallel encodings of classical planning as satisfiability. Technical Report 198, Institute of Computer Science at Freiburg University, 2004.

Suggested BibTeX entry:

@techreport{RHN2004:TR,
    author = {Jussi Rintanen and Keijo Heljanko and Ilkka Niemel{\"a}},
    institution = {Institute of Computer Science at Freiburg University},
    number = {198},
    title = {Parallel Encodings of Classical Planning as Satisfiability},
    type = {Technical Report},
    year = {2004},
}

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

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