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. In Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA'04), Lecture Notes in Artificial Intelligence 3229, pages 307–319, Lisbon, Portugal, September 2004. Springer.

Suggested BibTeX entry:

@inproceedings{RinHelNie:JELIA04,
    address = {Lisbon, Portugal},
    author = {Jussi Rintanen and Keijo Heljanko and Ilkka Niemel{\"a}},
    booktitle = {Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA'04)},
    month = {September},
    pages = {307--319},
    publisher = {Springer},
    series = {Lecture Notes in Artificial Intelligence 3229},
    title = {Parallel Encodings of Classical Planning as Satisfiability},
    year = {2004},
}

See www.tcs.hut.fi ...

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