{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T10:44:36Z","timestamp":1649155476863},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s10472-009-9170-5","type":"journal-article","created":{"date-parts":[[2009,11,13]],"date-time":"2009-11-13T07:50:25Z","timestamp":1258098625000},"page":"211-239","source":"Crossref","is-referenced-by-count":0,"title":["Set-structured and cost-sharing heuristics for classical planning"],"prefix":"10.1007","volume":"56","author":[{"given":"Carmel","family":"Domshlak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly","family":"Mirkis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,11,14]]},"reference":[{"key":"9170_CR1","volume-title":"Readings in Planning","year":"1990","unstructured":"Allen, J., Hendler, J., Tate, A. (eds.): Readings in Planning. Morgan-Kaufmann, San Francisco (1990)"},{"issue":"3","key":"9170_CR2","first-page":"47","volume":"22","author":"F Bacchus","year":"2001","unstructured":"Bacchus, F.: The AIPS-2000 planning competition. AI Mag. 22(3), 47\u201356 (2001)","journal-title":"AI Mag."},{"issue":"1\u20132","key":"9170_CR3","first-page":"279","volume":"90","author":"AL Blum","year":"1997","unstructured":"Blum, A.L., Furst, M.L.: Fast planning through planning graph analysis. Artif. Intell. 90(1\u20132), 279\u2013298 (1997)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"9170_CR4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0004-3702(01)00108-4","volume":"129","author":"B Bonet","year":"2001","unstructured":"Bonet, B., Geffner, H.: Planning as heuristic search. Artif. Intell. 129(1\u20132), 5\u201333 (2001)","journal-title":"Artif. Intell."},{"key":"9170_CR5","unstructured":"Bonet, B., Geffner, H.: Heuristics for planning with penalties and rewards using compiled knowledge. In: Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 452\u2013462 (2006)"},{"key":"9170_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.737","volume":"14","author":"RI Brafman","year":"2001","unstructured":"Brafman, R.I.: On reachability, relevance, and resolution in the planning as satisfiabilty approach. J. Artif. Intell. Res. 14, 1\u201328 (2001)","journal-title":"J. Artif. Intell. Res."},{"key":"9170_CR7","unstructured":"Bryce, D., Kambhampati, S.: How to skin a planning graph for fun and profit: a tutorial on planning graph based reachability heuristics. AI Mag. 27(4) (2006)"},{"key":"9170_CR8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1613\/jair.1869","volume":"26","author":"D Bryce","year":"2006","unstructured":"Bryce, D., Kambhampati, S., Smith, D.E.: Planning graph heuristics for belief space search. J. Artif. Intell. Res. 26, 35\u201399 (2006)","journal-title":"J. Artif. Intell. Res."},{"issue":"1\u20132","key":"9170_CR9","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0004-3702(94)90081-7","volume":"69","author":"T Bylander","year":"1994","unstructured":"Bylander, T.: The computational complexity of propositional STRIPS planning. Artif. Intell. 69(1\u20132), 165\u2013204 (1994)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"9170_CR10","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0004-3702(02)00375-2","volume":"147","author":"C Castellini","year":"2003","unstructured":"Castellini, C., Giunchiglia, E., Tacchella, A.: SAT-based planning in complex domains: concurrency, constraints and nondeterminism. Artif. Intell. 147(1\u20132), 85\u2013117 (2003)","journal-title":"Artif. Intell."},{"issue":"3","key":"9170_CR11","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0004-3702(87)90092-0","volume":"32","author":"D Chapman","year":"1987","unstructured":"Chapman, D.: Planning for conjunctive goals. Artif. Intell. 32(3), 333\u2013377 (1987)","journal-title":"Artif. Intell."},{"key":"9170_CR12","unstructured":"Charniak, E., Husain, S.: A new admissible heuristic for minimal-cost proofs. In: Proceedings of the National Conference on Artificial Intelligence (AAAI), pp. 446\u2013451 (1991)"},{"key":"9170_CR13","doi-asserted-by":"crossref","DOI":"10.21236\/ADA254568","volume-title":"Planning and Control","author":"T Dean","year":"1991","unstructured":"Dean, T., Wellman, M.: Planning and Control. Morgan-Kaufmann, San Francisco (1991)"},{"issue":"2","key":"9170_CR14","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0004-3702(01)00128-X","volume":"132","author":"MB Do","year":"2001","unstructured":"Do, M.B., Kambhampati, S.: Planning as constraint satisfaction: solving the planning graph by compiling it into CSP. Artif. Intell. 132(2), 151\u2013182 (2001)","journal-title":"Artif. Intell."},{"key":"9170_CR15","unstructured":"Domshlak, C., Hoffmann, J.: Fast probabilistic planning through weighted model counting. In: Proceedings of the 16th International Conference on Automated Planning and Scheduling (ICAPS), pp. 243\u2013252 (2006)"},{"key":"9170_CR16","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.2289","volume":"30","author":"C Domshlak","year":"2007","unstructured":"Domshlak, C., Hoffmann, J.: Probabilistic planning via heuristic forward search and weighted model counting. J. Artif. Intell. Res. 30, 565\u2013620 (2007)","journal-title":"J. Artif. Intell. Res."},{"key":"9170_CR17","unstructured":"Edelkamp, S.: Planning with pattern databases. In: Proceedings of the European Conference on Planning (ECP), pp. 13\u201324 (2001)"},{"key":"9170_CR18","unstructured":"Edelkamp, S.: Symbolic pattern databases in heuristic search planning. In: Proceedings of the International Conference on AI Planning and Scheduling (AIPS), pp. 274\u2013293 (2002)"},{"key":"9170_CR19","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"2","author":"RE Fikes","year":"1971","unstructured":"Fikes, R.E., Nilsson, N.: STRIPS: A new approach to the application of theorem proving to problem solving. Artif. Intell. 2, 189\u2013208 (1971)","journal-title":"Artif. Intell."},{"key":"9170_CR20","unstructured":"Geffner, H.: Perspectives on artificial intelligence planning. In: Proceedings of the Eighteenth National Conference on Artificial intelligence (AAAI), pp. 1013\u20131023 (2002)"},{"key":"9170_CR21","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1613\/jair.1183","volume":"20","author":"A Gerevini","year":"2003","unstructured":"Gerevini, A., Saetti, A., Serina, I.: Planning through stochastic local search and temporal action graphs. J. Artif. Intell. Res. 20, 239\u2013290 (2003)","journal-title":"J. Artif. Intell. Res."},{"key":"9170_CR22","volume-title":"Automated Planning","author":"M Ghallab","year":"2004","unstructured":"Ghallab, M., Nau, D., Traverso, P.: Automated Planning. Morgan Kaufmann, San Francisco (2004)"},{"issue":"2","key":"9170_CR23","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"9170_CR24","unstructured":"Haslum, P., Bonet, B., Geffner, H.: New admissible heuristics for domain-independent planning. In: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI), pp. 1163\u20131168. Pittsburgh, PA (2005)"},{"key":"9170_CR25","unstructured":"Haslum, P., Geffner, H.: Admissible heuristics for optimal planning. In: Proceedings of the 15th International Conference on Artificial Intelligence Planning Systems (AIPS), pp. 140\u2013149. Breckenridge, CO (2000)"},{"key":"9170_CR26","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1613\/jair.1705","volume":"26","author":"M Helmert","year":"2006","unstructured":"Helmert, M.: The fast downward planning system. J. Artif. Intell. Res. 26, 191\u2013246 (2006)","journal-title":"J. Artif. Intell. Res."},{"key":"9170_CR27","unstructured":"Helmert, M., Haslum, P., Hoffmann, J.: Flexible abstraction heuristics for optimal sequential planning. In: Proceedings of the 17th International Conference on Automated Planning and Scheduling (ICAPS), pp. 200\u2013207 (2007)"},{"key":"9170_CR28","unstructured":"Helmert, M., Mattm\u00fcller, R.: Accuracy of admissible heuristic functions in selected planning domains. In: Proceedings of the 23rd AAAI Conference on Artificial Intelligence, pp. 938\u2013943. Chicago, IL (2008)"},{"key":"9170_CR29","unstructured":"Hendler, J., Tate, A., Drummond, M.: AI planning: systems and techniques. AI Mag. (1990)"},{"key":"9170_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/b93903","volume-title":"Utilizing Problem Structure in Planning: A Local Search Approach. No. 2854 in LNAI","author":"J Hoffmann","year":"2003","unstructured":"Hoffmann, J.: Utilizing Problem Structure in Planning: A Local Search Approach. No. 2854 in LNAI. Springer, New York (2003)"},{"key":"9170_CR31","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1613\/jair.1747","volume":"24","author":"J Hoffmann","year":"2005","unstructured":"Hoffmann, J.: When \u2018ignoring delete lists\u2019 works: Local search topology in planning benchmarks. J. Artif. Intell. Res. 24, 685\u2013758 (2005)","journal-title":"J. Artif. Intell. Res."},{"issue":"6\u20137","key":"9170_CR32","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/j.artint.2006.01.003","volume":"170","author":"J Hoffmann","year":"2006","unstructured":"Hoffmann, J., Brafman, R.I.: Conformant planning via heuristic forward search: a new approach. Artif. Intell. 170(6\u20137), 507\u2013541 (2006)","journal-title":"Artif. Intell."},{"key":"9170_CR33","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1613\/jair.855","volume":"14","author":"J Hoffmann","year":"2001","unstructured":"Hoffmann, J., Nebel, B.: The FF planning system: fast plan generation through heuristic search. J. Artif. Intell. Res. 14, 253\u2013302 (2001)","journal-title":"J. Artif. Intell. Res."},{"key":"9170_CR34","unstructured":"Katz, M., Domshlak, C.: Structural patterns heuristics. In: ICAPS-07 Workshop on Heuristics for Domain-independent Planning: Progress, Ideas, Limitations, Challenges, Providence, RI (2007)"},{"key":"9170_CR35","unstructured":"Kautz, H., Selman, B.: Pushing the envelope: Planning, propositional logic, and stochastic search. In: Proceedings of the National Conference on Artificial Intelligence (AAAI), pp. 1194\u20131201 (1996)"},{"key":"9170_CR36","unstructured":"Kautz, H., Selman, B.: Unifying SAT-based and graph-based planning. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 318\u2013325 (1999)"},{"key":"9170_CR37","unstructured":"Keyder, E., Geffner, H.: Heuristics for planning with action costs revisited. In: Proceedings of the 18th European Conference on Artificial Intelligence, Patras, Greece (2008)"},{"issue":"1","key":"9170_CR38","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"RE Korf","year":"1985","unstructured":"Korf, R.E.: Depth-first iterative-deepening: an optimal admissible tree search. Artif. Intell. 27(1), 97\u2013109 (1985)","journal-title":"Artif. Intell."},{"issue":"4","key":"9170_CR39","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/BF00974979","volume":"5","author":"RE Korf","year":"1995","unstructured":"Korf, R.E.: Heuristic evaluation functions in artificial intelligence search algorithms. Minds and Mach. 5(4), 489\u2013498 (1995)","journal-title":"Minds and Mach."},{"key":"9170_CR40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.1240","volume":"20","author":"D Long","year":"2003","unstructured":"Long, D., Fox, M.: The 3rd international planning competition: Results and analysis. J. Artif. Intell. Res. 20, 1\u201359 (2003)","journal-title":"J. Artif. Intell. Res."},{"key":"9170_CR41","unstructured":"Lopez, A., Bacchus, F.: Generalizing GraphPlan by formulating planning as CSP. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 954\u2013960 (2003)"},{"issue":"1\u20132","key":"9170_CR42","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0004-3702(99)00010-7","volume":"109","author":"DV McDermott","year":"1999","unstructured":"McDermott, D.V.: Using regression-match graphs to control search in planning. Artif. Intell. 109(1\u20132), 111\u2013159 (1999)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"9170_CR43","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0004-3702(01)00158-8","volume":"135","author":"X-L Nguyen","year":"2002","unstructured":"Nguyen, X.-L., Kambhampati, S., Nigenda, R.S.: Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search. Artif. Intell. 135(1\u20132), 73\u2013123 (2002)","journal-title":"Artif. Intell."},{"key":"9170_CR44","volume-title":"Heuristics\u2014Intelligent Search Strategies for Computer Problem Solving","author":"J Pearl","year":"1984","unstructured":"Pearl, J.: Heuristics\u2014Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading (1984)"},{"key":"9170_CR45","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1613\/jair.893","volume":"15","author":"I Refanidis","year":"2001","unstructured":"Refanidis, I., Vlahavas, I.P.: The GRT planning system: backward heuristic construction in forward state-space planning. J. Artif. Intell. Res. 15, 115\u2013161 (2001)","journal-title":"J. Artif. Intell. Res."},{"key":"9170_CR46","unstructured":"Rintanen, J.: Unified definition of heuristics for classical planning. In: Proceedings of the 17th European Conference on Artificial Intelligence (ECAI-06), pp. 600\u2013604 (2006)"},{"key":"9170_CR47","volume-title":"Artificial Intelligence: A Modern Approach","author":"S Russell","year":"2004","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 2nd edn. Pearson, Metairie (2004)","edition":"2"},{"key":"9170_CR48","unstructured":"Shimony, S., Domshlak, C., Santos, E.J.: Cost-sharing in Bayesian knowledge bases. In: Proceedings of the 13th Conference on Uncertainty in Artificial Intelligence (UAI), pp. 421\u2013428 (1997)"},{"key":"9170_CR49","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0004-3702(00)00079-5","volume":"125","author":"J Slaney","year":"2001","unstructured":"Slaney, J., Thi\u00e9baux, S.: Blocks world revisited. Artif. Intell. 125, 119\u2013153 (2001)","journal-title":"Artif. Intell."},{"key":"9170_CR50","unstructured":"Smith, D.E., Weld, D.: Conformant graphplan. In: Proceedings of the National Conference on Artificial Intelligence (AAAI), pp. 889\u2013896 (1998)"},{"key":"9170_CR51","volume-title":"A Computer Model of Skill Acquisition","author":"GJ Sussman","year":"1975","unstructured":"Sussman, G.J.: A Computer Model of Skill Acquisition. Elsevier, Amsterdam (1975)"},{"key":"9170_CR52","unstructured":"Vidal, V.: A lookahead strategy for heuristic search planning. In: Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS), pp. 150\u2013160 (2004)"},{"issue":"2","key":"9170_CR53","first-page":"93","volume":"20","author":"DS Weld","year":"1999","unstructured":"Weld, D.S.: Recent advances in AI planning. AI Mag. 20(2), 93\u2013123 (1999)","journal-title":"AI Mag."},{"key":"9170_CR54","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0004-3702(84)90053-5","volume":"22","author":"DE Wilkins","year":"1984","unstructured":"Wilkins, D.E.: Domain-independent planning: representation and plan generation. Artif. Intell. 22, 269\u2013301 (1984)","journal-title":"Artif. Intell."},{"key":"9170_CR55","doi-asserted-by":"crossref","unstructured":"Wolfman, S.A., Weld, D.: Combining linear programming and satisfiability solving for resource planning. Knowl. Eng. Rev. 15(1) (2000)","DOI":"10.1017\/S0269888901000017"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-009-9170-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-009-9170-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-009-9170-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:58:13Z","timestamp":1559152693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-009-9170-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":55,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["9170"],"URL":"https:\/\/doi.org\/10.1007\/s10472-009-9170-5","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6]]}}}