{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T07:26:26Z","timestamp":1763105186511},"publisher-location":"Berlin, Heidelberg","reference-count":53,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540741275"},{"type":"electronic","value":"9783540741282"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74128-2_3","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T06:05:15Z","timestamp":1188194715000},"page":"35-50","source":"Crossref","is-referenced-by-count":6,"title":["Automated Creation of Pattern Database Search Heuristics"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Ball, T., Majumdar, R., Millstein, T.D., Rajamani, S.K.: Automatic predicate abstraction of c programs. In: SIGPLAN Conference on Programming Language Design and Implementation, pp. 203\u2013213 (2001)","DOI":"10.1145\/378795.378846"},{"key":"3_CR2","unstructured":"Brie, A.H., Morignot, P.: Genetic planning using variable length chromosomes. In: ICAPS, pp. 320\u2013329 (2005)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Bryant, R.E.: Symbolic manipulation of boolean functions using a graphical representation. In: ACM\/IEEE Design Automation Conference, pp. 688\u2013694 (1985)","DOI":"10.1109\/DAC.1985.1586017"},{"issue":"5","key":"3_CR4","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1145\/186025.186051","volume":"16","author":"E.M. Clarke","year":"1994","unstructured":"Clarke, E.M., Grumberg, O., Long, D.: Model checking and abstraction. ACM Transactions on Programming Languages and Systems\u00a016(5), 1512\u20131542 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"4","key":"3_CR5","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1111\/0824-7935.00065","volume":"14","author":"J.C. Culberson","year":"1998","unstructured":"Culberson, J.C., Schaeffer, J.: Pattern databases. Computational Intelligence\u00a014(4), 318\u2013334 (1998)","journal-title":"Computational Intelligence"},{"key":"3_CR6","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2005","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2005)"},{"key":"3_CR7","unstructured":"Edelkamp, S.: Planning with pattern databases. In: ECP, pp. 13\u201324 (2001)"},{"key":"3_CR8","unstructured":"Edelkamp, S.: Symbolic pattern databases in heuristic search planning. In: AIPS, pp. 274\u2013293 (2002)"},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1613\/jair.1302","volume":"20","author":"S. Edelkamp","year":"2003","unstructured":"Edelkamp, S.: Taming numbers and durations in the model checking integrated planning system. Journal of Artificial Intelligence Research\u00a020, 195\u2013238 (2003)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"3_CR10","unstructured":"Edelkamp, S.: External symbolic heuristic search with pattern databases. In: ICAPS, pp. 51\u201360 (2005)"},{"key":"3_CR11","unstructured":"Edelkamp, S., Lluch-Lafuente, A.: Abstraction in directed model checking. In: ICAPS-Workshop on Connecting Planning Theory with Practice (2004)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Edelkamp, S., Reffel, F.: OBDDs in heuristic search. In: KI, pp. 81\u201392 (1998)","DOI":"10.1007\/BFb0095430"},{"key":"3_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/11527862_18","volume-title":"Abstraction, Reformulation and Approximation","author":"A. Felner","year":"2005","unstructured":"Felner, A., Alder, A.: Solving the 24 puzzle with instance dependent pattern databases. In: Zucker, J.-D., Saitta, L. (eds.) SARA 2005. LNCS (LNAI), vol.\u00a03607, pp. 248\u2013260. Springer, Heidelberg (2005)"},{"key":"3_CR14","unstructured":"Felner, A., Meshulam, R., Holte, R.C., Korf, R.E.: Compressing pattern databases. In: AAAI, pp. 638\u2013643 (2004)"},{"key":"3_CR15","unstructured":"Felner, A., Zahavi, U., Schaeffer, J., Holte, R.: Dual lookups in pattern databases. In: IJCAI, pp. 103\u2013108 (2005)"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"2","author":"R. Fikes","year":"1971","unstructured":"Fikes, R., Nilsson, N.: STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence\u00a02, 189\u2013208 (1971)","journal-title":"Artificial Intelligence"},{"key":"3_CR17","unstructured":"Gaschnig, J.: A problem similarity approach to devising heuristics: First results. In: IJCAI, pp. 434\u2013441 (1979)"},{"issue":"2","key":"3_CR18","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s10009-004-0141-1","volume":"6","author":"P. Godefroid","year":"2004","unstructured":"Godefroid, P., Khurshid, S.: Exploring very large state spaces using genetic algorithms. STTT\u00a06(2), 117\u2013127 (2004)","journal-title":"STTT"},{"key":"3_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45622-8_7","volume-title":"Abstraction, Reformulation, and Approximation","author":"E.A. Hansen","year":"2002","unstructured":"Hansen, E.A., Zhou, R., Feng, Z.: Symbolic heuristic search using decision diagrams. In: Koenig, S., Holte, R.C. (eds.) SARA 2002. LNCS (LNAI), vol.\u00a02371, Springer, Heidelberg (2002)"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0004-3702(92)90045-Y","volume":"55","author":"O. Hansson","year":"1992","unstructured":"Hansson, O., Mayer, A., Valtora, M.: A new result on the complexity of heuristic estimates for the A* algorithm (research note). Artificial Intelligence\u00a055, 129\u2013143 (1992)","journal-title":"Artificial Intelligence"},{"key":"3_CR21","unstructured":"Haslum, P., Bonet, B., Geffner, H.: New admissible heuristics for domain-independent planning. In: AAAI, pp. 1163\u20131168 (2005)"},{"key":"3_CR22","unstructured":"Haslum, P., Geffner, H.: Admissible heuristics for optimal planning. pp. 140\u2013149 (2000)"},{"key":"3_CR23","unstructured":"Helmert, M.: A planning heuristic based on causal graph analysis. In: ICAPS, pp. 161\u2013170 (2004)"},{"key":"3_CR24","unstructured":"Hern\u00e1dv\u00f6lgyi, I.T.: Automatically Generated Lower Bounds for Search. PhD thesis, University of Ottawa (2003)"},{"key":"3_CR25","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1613\/jair.855","volume":"14","author":"J. Hoffmann","year":"2001","unstructured":"Hoffmann, J., Nebel, B.: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research\u00a014, 253\u2013302 (2001)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"3_CR26","unstructured":"Holland, J.: Adaption in Natural and Artificial Systems. PhD thesis, University of Michigan (1975)"},{"key":"3_CR27","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/11527862_9","volume-title":"Abstraction, Reformulation and Approximation","author":"R.C. Holte","year":"2005","unstructured":"Holte, R.C., Grajkowski, J., Tanner, B.: Hierarchical heuristic search revisited. In: Zucker, J.-D., Saitta, L. (eds.) SARA 2005. LNCS (LNAI), vol.\u00a03607, pp. 121\u2013133. Springer, Heidelberg (2005)"},{"key":"3_CR28","unstructured":"Holte, R.C., Hern\u00e1dv\u00f6gyi, I.T.: A space-time tradeoff for memory-based heuristics. In: AAAI (1999)"},{"key":"3_CR29","unstructured":"Holte, R.C., Newton, J., Felner, A., Meshulam, R., Furcy, D.: Multiple pattern databases. In: ICAPS, pp. 122\u2013131 (2004)"},{"key":"3_CR30","unstructured":"Holte, R.C., Perez, M.B., Zimmer, R.M., Donald, A.J.: Hierarchical A*: Searching abstraction hierarchies. In: AAAI, pp. 530\u2013535 (1996)"},{"key":"3_CR31","unstructured":"Jensen, R.M., Bryant, R.E., Veloso, M.M.: SetA*: An efficient BDD-based heuristic search algorithm. In: AAAI, pp. 668\u2013673 (2002)"},{"key":"3_CR32","unstructured":"Junghanns, A.: Pushing the Limits: New Developments in Single-Agent Search. PhD thesis, University of Alberta (1999)"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Klein, D., Manning, C.: A* parsing: Fast exact Viterbi parse selection. In: Human Language Technology Conference of North American Chapter of the Association for Computational Linguistics (2003)","DOI":"10.3115\/1073445.1073461"},{"issue":"2","key":"3_CR34","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0004-3702(94)90069-8","volume":"68","author":"C.A. Knoblock","year":"1994","unstructured":"Knoblock, C.A.: Automatically generating abstractions for planning. Artificial Intelligence\u00a068(2), 243\u2013302 (1994)","journal-title":"Artificial Intelligence"},{"key":"3_CR35","unstructured":"Korf, R.E.: Finding optimal solutions to Rubik\u2019s Cube using pattern databases. In: AAAI, pp. 700\u2013705 (1997)"},{"key":"3_CR36","first-page":"13","volume-title":"chapter Disjoint Pattern Database Heuristics","author":"R.E. Korf","year":"2002","unstructured":"Korf, R.E., Felner, A.: Chips Challenging Champions: Games, Computers and Artificial Intelligence. In: chapter Disjoint Pattern Database Heuristics, pp. 13\u201326. Elsevier, Amsterdam (2002)"},{"issue":"1-2","key":"3_CR37","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0004-3702(01)00094-7","volume":"129","author":"R.E. Korf","year":"2001","unstructured":"Korf, R.E., Reid, M., Edelkamp, S.: Time Complexity of Iterative-Deepening-A*. Artificial Intelligence\u00a0129(1-2), 199\u2013218 (2001)","journal-title":"Artificial Intelligence"},{"issue":"5","key":"3_CR38","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1145\/1089023.1089024","volume":"52","author":"R.E. Korf","year":"2005","unstructured":"Korf, R.E., Zhang, W., Thayer, I., Hohwald, H.: Frontier search. Journal of the ACM\u00a052(5), 715\u2013748 (2005)","journal-title":"Journal of the ACM"},{"key":"3_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11691617_3","volume-title":"Model Checking Software","author":"S. Kupferschmid","year":"2006","unstructured":"Kupferschmid, S., Hoffmann, J., Dierks, H., Behrmann, G.: Adapting an ai planning heuristic for directed model checking. In: Valmari, A. (ed.) Model Checking Software. LNCS, vol.\u00a03925, Springer, Heidelberg (2006)"},{"key":"3_CR40","doi-asserted-by":"crossref","unstructured":"Mostow, J., Prieditis, A.E.: Discovering admissible heuristics by abstracting and optimizing. In: IJCAI, pp. 701 \u2013 707 (1989)","DOI":"10.1016\/B978-1-55860-036-2.50068-0"},{"key":"3_CR41","doi-asserted-by":"crossref","unstructured":"Muslea, I.: A general-propose AI planning system based on genetic programming. In: Genetic Programming Conference (Late Breaking Papers), pp. 157\u2013164 (1997)","DOI":"10.1007\/3-540-63912-8_95"},{"key":"3_CR42","volume-title":"Heuristics","author":"J. Pearl","year":"1985","unstructured":"Pearl, J.: Heuristics. Addison-Wesley, London (1985)"},{"key":"3_CR43","doi-asserted-by":"crossref","unstructured":"Qian, K., Nymeyer, A.: Heuristic search algorithms based on symbolic data structures. In: ACAI, pp. 966\u2013979 (2003)","DOI":"10.1007\/978-3-540-24581-0_83"},{"key":"3_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/978-3-540-24730-2_37","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Qian","year":"2004","unstructured":"Qian, K., Nymeyer, A.: Guided invariant model checking based on abstraction and symbolic pattern databases. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 497\u2013511. Springer, Heidelberg (2004)"},{"key":"3_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-63166-6_10","volume-title":"Computer Aided Verification","author":"S. Graf","year":"1997","unstructured":"Graf, S., Saidi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 72\u201383. Springer, Heidelberg (1997)"},{"key":"3_CR46","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1613\/jair.1534","volume":"23","author":"S. Schroedl","year":"2005","unstructured":"Schroedl, S.: An improved search algorithm for optimal multiple sequence alignment. Journal of Artificial Intelligence Research\u00a023, 587\u2013623 (2005)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"3_CR47","doi-asserted-by":"crossref","unstructured":"Silver, D.: Cooperative pathfinding. In: Conference on Artificial Intelligence and Interactive Digital Entertainment, pp. 117\u2013122 (2005)","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"3_CR48","unstructured":"Spector, L.: Genetic programming and AI planning systems. In: AAAI, pp. 1329\u20131334 (1994)"},{"key":"3_CR49","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. Information Sciences\u00a034, 48\u201359 (1984)","journal-title":"Information Sciences"},{"key":"3_CR50","unstructured":"Wall, M.: GAlib \u2013 A C++ Library of Genetic Algorithm Components. Massachusetts Institute of Technology (2005)"},{"key":"3_CR51","unstructured":"Westerberg, H., Levine, J.: Optimising plans using genetic programming. In: ECP, page Poster (2001)"},{"key":"3_CR52","unstructured":"Zhou, R., Hansen, E.: Space-efficient memory-based heuristics. In: AAAI, pp. 677\u2013682 (2004)"},{"key":"3_CR53","unstructured":"Zhou, R., Hansen, E.: External-memory pattern databases using structured duplicate detection. In: AAAI (2005)"}],"container-title":["Lecture Notes in Computer Science","Model Checking and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74128-2_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T22:42:56Z","timestamp":1684017776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74128-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540741275","9783540741282"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74128-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}