{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:49:20Z","timestamp":1725493760637},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540752707"},{"type":"electronic","value":"9783540752714"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75271-4_14","type":"book-chapter","created":{"date-parts":[[2007,10,29]],"date-time":"2007-10-29T09:16:25Z","timestamp":1193649385000},"page":"130-139","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Pruning of Operators in Planning Domains"],"prefix":"10.1007","author":[{"given":"Anders","family":"Jonsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"14_CR1","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1111\/j.1467-8640.1995.tb00052.x","volume":"11","author":"C. B\u00e4ckstr\u00f6m","year":"1995","unstructured":"B\u00e4ckstr\u00f6m, C., Nebel, B.: Complexity results for SAS\u2009+\u2009 planning. Computational Intelligence\u00a011(4), 625\u2013655 (1995)","journal-title":"Computational Intelligence"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Nebel, B., Dimopoulos, Y., Koehler, J.: Ignoring irrelevant facts and operators in plan generation. In: Proceedings of the 4th European Conference on Planning, pp. 338\u2013350 (1997)","DOI":"10.1007\/3-540-63912-8_97"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Scholz, U.: Action constraints for planning. In: Proceedings of the 5th European Conference on Planning, pp. 148\u2013158 (1999)","DOI":"10.1007\/10720246_12"},{"key":"14_CR4","unstructured":"Haslum, P., Jonsson, P.: Planning with Reduced Operator Sets. In: Proceedings of the 5th International Conference on Automated Planning and Scheduling, pp. 150\u2013158 (2000)"},{"key":"14_CR5","unstructured":"Scholz, U.: Reducing Planning Problems by Path Reduction. Ph.D Thesis, Darmstadt University of Technology, Darmstadt, Germany (2004)"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Vidal, V., Geffner, H.: Solving Simple Planning Problems with More Inference and No Search. In: Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming, pp. 682\u2013696 (2005)","DOI":"10.1007\/11564751_50"},{"key":"14_CR7","unstructured":"Helmert, M.: Solving Planning Tasks in Theory and Practice. Ph.D Thesis, Albert-Ludwigs-Universit\u00e4t, Freiburg, Germany (2006)"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10462-007-9049-y","volume":"26","author":"M. Helmert","year":"2006","unstructured":"Helmert, M.: The Fast Downward Planning System. Journal of Artificial Intelligence Research\u00a026, 191\u2013246 (2006)","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Lecture Notes in Computer Science","Current Topics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75271-4_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:57:51Z","timestamp":1619521071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75271-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540752707","9783540752714"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75271-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}