{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:39:09Z","timestamp":1726043949927},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030301781"},{"type":"electronic","value":"9783030301798"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30179-8_21","type":"book-chapter","created":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T19:03:18Z","timestamp":1567969398000},"page":"249-263","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Simplifying Automated Pattern Selection for Planning with Symbolic Pattern Databases"],"prefix":"10.1007","author":[{"given":"Ionut","family":"Moraru","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Edelkamp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santiago","family":"Franco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moises","family":"Martinez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,24]]},"reference":[{"unstructured":"B\u00e4ckstr\u00f6m, C.: Equivalence and tractability results for SAS+ planning. In: KR, pp. 126\u2013137 (1992)","key":"21_CR1"},{"issue":"1\u20132","key":"21_CR2","doi-asserted-by":"publisher","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":"4","key":"21_CR3","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1111\/0824-7935.00065","volume":"14","author":"JC Culberson","year":"1998","unstructured":"Culberson, J.C., Schaeffer, J.: Pattern databases. Comput. Intell. 14(4), 318\u2013334 (1998)","journal-title":"Comput. Intell."},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-74450-4_1","volume-title":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","author":"G D\u00f3sa","year":"2007","unstructured":"D\u00f3sa, G.: The tight bound of first fit decreasing bin-packing algorithm is FFD(i) $${\\le }$$ 11\/9opt (i)+ 6\/9. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614, pp. 1\u201311. Springer, Berlin (2007). https:\/\/doi.org\/10.1007\/978-3-540-74450-4_1"},{"doi-asserted-by":"crossref","unstructured":"Edelkamp, S.: Symbolic pattern databases in heuristic search planning. In: AIPS, pp. 274\u2013283 (2002)","key":"21_CR5","DOI":"10.1016\/B978-0-12-372512-7.00007-9"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-540-74128-2_3","volume-title":"Model Checking and Artificial Intelligence","author":"S Edelkamp","year":"2007","unstructured":"Edelkamp, S.: Automated creation of pattern database search heuristics. In: Edelkamp, S., Lomuscio, A. (eds.) MoChArt 2006. LNCS (LNAI), vol. 4428, pp. 35\u201350. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74128-2_3"},{"unstructured":"Edelkamp, S.: Planning with pattern databases. In: Sixth European Conference on Planning (2014)","key":"21_CR7"},{"issue":"3\u20134","key":"21_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"2","author":"RE Fikes","year":"1971","unstructured":"Fikes, R.E., Nilsson, N.J.: STRIPS: a new approach to the application of theorem proving to problem solving. Artif. Intell. 2(3\u20134), 189\u2013208 (1971)","journal-title":"Artif. Intell."},{"doi-asserted-by":"crossref","unstructured":"Franco, S., Torralba, A., Lelis, L.H., Barley, M.: On creating complementary pattern databases. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence, pp. 4302\u20134309. AAAI Press (2017)","key":"21_CR9","DOI":"10.24963\/ijcai.2017\/601"},{"key":"21_CR10","volume-title":"Computers and Intractibility, A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractibility, A Guide to the Theory of NP-Completeness. Freeman & Company, New York (1979)"},{"unstructured":"Gaschnig, J.: A problem similarity approach to devising heuristics: first results, pp. 434\u2013441 (1979)","key":"21_CR11"},{"issue":"2","key":"21_CR12","doi-asserted-by":"publisher","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."},{"unstructured":"Haslum, P., Botea, A., Helmert, M., Bonet, B., Koenig, S.: Domain-independent construction of pattern database heuristics for cost-optimal planning, pp. 1007\u20131012 (2007)","key":"21_CR13"},{"unstructured":"Haslum, P., Bonet, B., Geffner, H., et al.: New admissible heuristics for domain-independent planning. In: AAAI, vol. 5, pp. 9\u201313 (2005)","key":"21_CR14"},{"unstructured":"Helmert, M.: A planning heuristic based on causal graph analysis, pp. 161\u2013170 (2004)","key":"21_CR15"},{"key":"21_CR16","doi-asserted-by":"publisher","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."},{"unstructured":"Holland, J.: Adaption in natural and artificial systems. Ph.D. thesis, University of Michigan (1975)","key":"21_CR17"},{"unstructured":"Holte, R., Newton, J., Felner, A., Meshulam, R., Furcy, D.: Multiple pattern databases, pp. 122\u2013131 (2004)","key":"21_CR18"},{"unstructured":"Holte, R.C., Hern\u00e1dv\u00f6lgyi, I.T.: A space-time tradeoff for memory-based heuristics. In: AAAI\/IAAI, pp. 704\u2013709. Citeseer (1999)","key":"21_CR19"},{"unstructured":"Katz, M., Domshlak, C.: Optimal additive composition of abstraction-based admissible heuristics. In: ICAPS, pp. 174\u2013181 (2008)","key":"21_CR20"},{"doi-asserted-by":"crossref","unstructured":"Kissmann, P., Edelkamp, S.: Improving cost-optimal domain-independent symbolic planning. In: Twenty-Fifth AAAI Conference on Artificial Intelligence (2011)","key":"21_CR21","DOI":"10.1609\/aaai.v25i1.8009"},{"unstructured":"Korf, R.E.: Finding optimal solutions to Rubik\u2019s cube using pattern databases, pp. 700\u2013705 (1997)","key":"21_CR22"},{"unstructured":"Korf, R.E., Felner, A.: Disjoint pattern database heuristics. In: Chips Challenging Champions: Games, Computers and Artificial Intelligence, pp. 13\u201326. Elsevier (2002)","key":"21_CR23"},{"unstructured":"McDermott, D.: The 1998 AI planning systems competition. In: AI Magazine, pp. 35\u201355 (1998)","key":"21_CR24"},{"key":"21_CR25","volume-title":"Heuristics: Intelligent Search Strategies for Computer Problem Solving","author":"J Pearl","year":"1984","unstructured":"Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Boston (1984)"},{"doi-asserted-by":"crossref","unstructured":"Pommerening, F., Helmert, M., R\u00f6ger, G., Seipp, J.: From non-negative to general operator cost partitioning. In: Twenty-Ninth AAAI Conference on Artificial Intelligence (2015)","key":"21_CR26","DOI":"10.1609\/aaai.v29i1.9668"},{"key":"21_CR27","first-page":"117","volume":"12","author":"A Preditis","year":"1993","unstructured":"Preditis, A.: Machine discovery of admissible heuristics. Mach. Learn. 12, 117\u2013142 (1993)","journal-title":"Mach. Learn."},{"key":"21_CR28","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1613\/jair.1.11217","volume":"62","author":"J Seipp","year":"2018","unstructured":"Seipp, J., Helmert, M.: Counterexample-guided Cartesian abstraction refinement for classical planning. J. Artif. Intell. Res. 62, 535\u2013577 (2018)","journal-title":"J. Artif. Intell. Res."},{"doi-asserted-by":"crossref","unstructured":"Seipp, J., Keller, T., Helmert, M.: A comparison of cost partitioning algorithms for optimal classical planning. In: Twenty-Seventh International Conference on Automated Planning and Scheduling (2017)","key":"21_CR29","DOI":"10.1609\/icaps.v27i1.13823"},{"key":"21_CR30","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/0020-0255(84)90009-4","volume":"34","author":"M Valtorta","year":"1984","unstructured":"Valtorta, M.: A result on the computational complexity of heuristic estimates for the A* algorithm. Inf. Sci. 34, 48\u201359 (1984)","journal-title":"Inf. Sci."},{"key":"21_CR31","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1613\/jair.2486","volume":"32","author":"F Yang","year":"2008","unstructured":"Yang, F., Culberson, J., Holte, R., Zahavi, U., Felner, A.: A general theory of additive state space abstractions. J. Artif. Intell. Res. 32, 631\u2013662 (2008)","journal-title":"J. Artif. Intell. Res."}],"container-title":["Lecture Notes in Computer Science","KI 2019: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30179-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T20:28:09Z","timestamp":1695155289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30179-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030301781","9783030301798"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30179-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint German\/Austrian Conference on Artificial Intelligence (K\u00fcnstliche Intelligenz)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kassel","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ki2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ki2019.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"82","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}