{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T23:17:59Z","timestamp":1768519079740,"version":"3.49.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":4223,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1016\/s0004-3702(01)00092-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:06:09Z","timestamp":1027591569000},"page":"9-22","source":"Crossref","is-referenced-by-count":66,"title":["Disjoint pattern database heuristics"],"prefix":"10.1016","volume":"134","author":[{"given":"Richard E.","family":"Korf","sequence":"first","affiliation":[]},{"given":"Ariel","family":"Felner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0004-3702(01)00092-3_BIB001","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1111\/0824-7935.00065","article-title":"Pattern databases","volume":"14","author":"Culberson","year":"1998","journal-title":"Computational Intelligence"},{"key":"10.1016\/S0004-3702(01)00092-3_BIB002","series-title":"Improving search techniques and using them on different environments, Ph.D. Thesis","author":"Felner","year":"2001"},{"key":"10.1016\/S0004-3702(01)00092-3_BIB003","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0004-3702(01)00092-3_BIB004","series-title":"Harnessing computational resources for efficient exhaustive search, Ph.D. Thesis","author":"Gasser","year":"1995"},{"issue":"3","key":"10.1016\/S0004-3702(01)00092-3_BIB005","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0020-0255(92)90070-O","article-title":"Criticizing solutions to relaxed models yields powerful admissible heuristics","volume":"63","author":"Hansson","year":"1992","journal-title":"Information Sci."},{"issue":"2","key":"10.1016\/S0004-3702(01)00092-3_BIB006","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Systems Science and Cybernetics"},{"key":"10.1016\/S0004-3702(01)00092-3_BIB007","doi-asserted-by":"crossref","first-page":"397","DOI":"10.2307\/2369492","article-title":"Notes on the 15 puzzle","volume":"2","author":"Johnson","year":"1879","journal-title":"Amer. J. Math."},{"issue":"1","key":"10.1016\/S0004-3702(01)00092-3_BIB008","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","article-title":"Depth-first iterative-deepening: An optimal admissible tree search","volume":"27","author":"Korf","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00092-3_BIB009","series-title":"Proc. AAAI-96, Portland, OR","first-page":"1202","article-title":"Finding optimal solutions to the twenty-four puzzle","author":"Korf","year":"1996"},{"key":"10.1016\/S0004-3702(01)00092-3_BIB010","series-title":"Proc. AAAI-97, Providence, RI","first-page":"700","article-title":"Finding optimal solutions to Rubik's Cube using pattern databases","author":"Korf","year":"1997"},{"key":"10.1016\/S0004-3702(01)00092-3_BIB011","series-title":"Proc. AAAI-2000, Austin, TX","first-page":"1165","article-title":"Recent progress in the design and analysis of admissible heuristic functions","author":"Korf","year":"2000"},{"key":"10.1016\/S0004-3702(01)00092-3_BIB012","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0004-3702(01)00094-7","article-title":"Time complexity of iterative deepening-A\u2217","volume":"129","author":"Korf","year":"2001","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00092-3_BIB013","series-title":"Mathematical Puzzles of Sam Loyd (selected and edited by Martin Gardner)","author":"Loyd","year":"1959"},{"key":"10.1016\/S0004-3702(01)00092-3_BIB014","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0004-3702(01)00092-3_BIB015","series-title":"Heuristics","author":"Pearl","year":"1984"},{"key":"10.1016\/S0004-3702(01)00092-3_BIB016","series-title":"Proc. AAAI-93 Washington, DC","first-page":"756","article-title":"Pruning duplicate nodes in depth-first search","author":"Taylor","year":"1993"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370201000923?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370201000923?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T09:57:23Z","timestamp":1556877443000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370201000923"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0004370201000923"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(01)00092-3","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}