{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:18:40Z","timestamp":1775053120768,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540232421","type":"print"},{"value":"9783540302278","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30227-8_27","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T01:34:52Z","timestamp":1284860092000},"page":"307-319","source":"Crossref","is-referenced-by-count":5,"title":["Parallel Encodings of Classical Planning as Satisfiability"],"prefix":"10.1007","author":[{"given":"Jussi","family":"Rintanen","sequence":"first","affiliation":[]},{"given":"Keijo","family":"Heljanko","sequence":"additional","affiliation":[]},{"given":"Ilkka","family":"Niemel\u00e4","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0304-3975(87)90090-9","volume":"55","author":"E. Best","year":"1987","unstructured":"Best, E., Devillers, R.: Sequential and concurrent behavior in Petri net theory. Theoretical Computer Science\u00a055, 87\u2013136 (1987)","journal-title":"Theoretical Computer Science"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0004-3702(96)00047-1","volume":"90","author":"A.L. Blum","year":"1997","unstructured":"Blum, A.L., Furst, M.L.: Fast planning through planning graph analysis. Artificial Intelligence\u00a090, 281\u2013300 (1997)","journal-title":"Artificial Intelligence"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0004-3702(01)00082-0","volume":"130","author":"M. Cayrol","year":"2001","unstructured":"Cayrol, M., R\u00e9gnier, P., Vidal, V.: Least commitment in Graphplan. Artificial Intelligence\u00a0130, 85\u2013118 (2001)","journal-title":"Artificial Intelligence"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-63912-8_84","volume-title":"Recent Advances in AI Planning","author":"Y. Dimopoulos","year":"1997","unstructured":"Dimopoulos, Y., Nebel, B., Koehler, J.: Encoding planning problems in nonmonotonic logic programs. In: Steel, S. (ed.) ECP 1997. LNCS, vol.\u00a01348, pp. 169\u2013181. Springer, Heidelberg (1997)"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/3-540-44685-0_15","volume-title":"CONCUR 2001 - Concurrency Theory","author":"K. Heljanko","year":"2001","unstructured":"Heljanko, K.: Bounded reachability checking with process semantics. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 218\u2013232. Springer, Heidelberg (2001)"},{"key":"27_CR6","first-page":"1194","volume-title":"Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference","author":"H. Kautz","year":"1996","unstructured":"Kautz, H., Selman, B.: Pushing the envelope: planning, propositional logic, and stochastic search. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, Menlo Park, California, pp. 1194\u20131201. AAAI Press, Menlo Park (1996)"},{"key":"27_CR7","first-page":"318","volume-title":"Proceedings of the 16th International Joint Conference on Artificial Intelligence","author":"H. Kautz","year":"1999","unstructured":"Kautz, H., Selman, B.: Unifying SAT-based and graph-based planning. In: Dean, T. (ed.) Proceedings of the 16th International Joint Conference on Artificial Intelligence, pp. 318\u2013325. Morgan Kaufmann Publishers, San Francisco (1999)"},{"key":"27_CR8","first-page":"617","volume-title":"Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR 1998)","author":"J. Rintanen","year":"1998","unstructured":"Rintanen, J.: A planning algorithm not based on directional search. In: Cohn, A.G., Schubert, L.K., Shapiro, S.C. (eds.) Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR 1998), pp. 617\u2013624. Morgan Kaufmann Publishers, San Francisco (1998)"},{"key":"27_CR9","volume-title":"Proceedings of the 16th European Conference on Artificial Intelligence","author":"J. Rintanen","year":"2004","unstructured":"Rintanen, J.: Evaluation strategies for planning as satisfiability. In: Saitta, L. (ed.) Proceedings of the 16th European Conference on Artificial Intelligence, IOS Press, Amsterdam (2004) (to appear)"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30227-8_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:58:06Z","timestamp":1620014286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30227-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232421","9783540302278"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30227-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}