{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T10:36:11Z","timestamp":1768559771732,"version":"3.49.0"},"reference-count":52,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"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":6202,"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":[[1996,8]]},"DOI":"10.1016\/0004-3702(95)00111-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:38Z","timestamp":1027640258000},"page":"321-361","source":"Crossref","is-referenced-by-count":48,"title":["Speeding up problem solving by abstraction: a graph oriented approach"],"prefix":"10.1016","volume":"85","author":[{"given":"R.C.","family":"Holte","sequence":"first","affiliation":[]},{"given":"T.","family":"Mkadmi","sequence":"additional","affiliation":[]},{"given":"R.M.","family":"Zimmer","sequence":"additional","affiliation":[]},{"given":"A.J.","family":"MacDonald","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(95)00111-5_BIB1","first-page":"131","article-title":"On representations of problems of reasoning about actions","volume":"3","author":"Amarel","year":"1968"},{"key":"10.1016\/0004-3702(95)00111-5_BIB2","series-title":"Using temporal logic to control search in a forward chaining planner","author":"Bacchus","year":"1994"},{"key":"10.1016\/0004-3702(95)00111-5_BIB3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0004-3702(94)90062-0","article-title":"Downward refinement and the efficiency of hierarchical problem solving","volume":"71","author":"Bacchus","year":"1994","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00111-5_BIB4","author":"Banerji","year":"1980"},{"key":"10.1016\/0004-3702(95)00111-5_BIB5","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0004-3702(94)90020-5","article-title":"Algorithms for searching explicit AND\/OR graphs and their applications to problem reduction search","volume":"65","author":"Chakrabarti","year":"1994","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00111-5_BIB6","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0004-3702(86)90074-3","article-title":"Heuristic search through islands","volume":"29","author":"Chakrabarti","year":"1986","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00111-5_BIB7","article-title":"Shortest path algorithms: theory and experimental evaluation","author":"Cherkassky","year":"1993"},{"key":"10.1016\/0004-3702(95)00111-5_BIB8","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0004-3702(94)90040-X","article-title":"Perimeter search","volume":"65","author":"Dillenburg","year":"1994","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00111-5_BIB9","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1145\/174147.174150","article-title":"Kinodynamic motion planning","volume":"40","author":"Donald","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(95)00111-5_BIB10","article-title":"New developments of the graph traverser","volume":"2","author":"Doran","year":"1968"},{"key":"10.1016\/0004-3702(95)00111-5_BIB11","first-page":"235","article-title":"Experiments with the graph traverser program","volume":"294","author":"Doran","year":"1966"},{"key":"10.1016\/0004-3702(95)00111-5_BIB12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0004-3702(93)90035-A","article-title":"A structural theory of explanation-based learning","volume":"60","author":"Etzioni","year":"1993","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00111-5_BIB13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","article-title":"STRIPS: a new approach to the application of theorem proving to problem solving","volume":"2","author":"Fikes","year":"1971","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00111-5_BIB14","series-title":"Proceedings IJCAI-93","first-page":"1374","article-title":"Characterizing and automatically finding primary effects in planning","author":"Fink","year":"1993"},{"key":"10.1016\/0004-3702(95)00111-5_BIB15","series-title":"Proceedings IJCAI-81","first-page":"563","article-title":"Search methods using heuristic strategies","author":"Georgeff","year":"1981"},{"key":"10.1016\/0004-3702(95)00111-5_BIB16","series-title":"Proceedings AAAI-92","first-page":"241","article-title":"A statistical approach to solving the EBL utility problem","author":"Greiner","year":"1992"},{"key":"10.1016\/0004-3702(95)00111-5_BIB17","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0004-3702(92)90045-Y","article-title":"A new result on the complexity of heuristic estimates for the A\u2217 algorithm","volume":"55","author":"Hansson","year":"1992","journal-title":"Artif. Intell."},{"issue":"2","key":"10.1016\/0004-3702(95)00111-5_BIB18","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 path","volume":"4","author":"Hart","year":"1968","journal-title":"EEE Trans. Syst. Sci. Cybern."},{"key":"10.1016\/0004-3702(95)00111-5_BIB19","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1093\/comjnl\/20.3.282","article-title":"A note on the towers of Hanoi problem","volume":"20","author":"Hayes","year":"1977","journal-title":"Comput. J."},{"key":"10.1016\/0004-3702(95)00111-5_BIB20","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0004-3702(88)90037-9","article-title":"Semantic interpretation and ambiguity","volume":"34","author":"Hirst","year":"1988","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00111-5_BIB21","series-title":"Proceedings 10th Conference on AI and Applications","first-page":"474","article-title":"Routing heuristics for Cayley graph topologies","author":"Hitz","year":"1994"},{"key":"10.1016\/0004-3702(95)00111-5_BIB22","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1022631118932","article-title":"Very simple classification rules perform well on most commonly-used datasets","volume":"11","author":"Holte","year":"1993","journal-title":"Mach. Learn."},{"key":"10.1016\/0004-3702(95)00111-5_BIB23","series-title":"Proceedings IJCAI-89","first-page":"813","article-title":"Concept learning and the problem of small disjuncts","author":"Holte","year":"1989"},{"key":"10.1016\/0004-3702(95)00111-5_BIB24","series-title":"Proceedings 10th Canadian Conference on Artificial Intelligence","first-page":"263","article-title":"Searching with abstractions: a unifying framework and new high-performance algorithm","author":"Holte","year":"1994"},{"key":"10.1016\/0004-3702(95)00111-5_BIB25","series-title":"Proceedings Symposium on Abstraction, Reformulation, and Approximation","article-title":"Hierarchical A\u2217","author":"Holte","year":"1995"},{"key":"10.1016\/0004-3702(95)00111-5_BIB26","article-title":"Randomized preprocessing of configuration space for fast path planning","author":"Kavraki","year":"1993"},{"key":"10.1016\/0004-3702(95)00111-5_BIB27","series-title":"Proceedings IEEE International Conference on Robotics and Automation","article-title":"Randomized preprocessing of configuration space tor fast path planning","author":"Kavraki","year":"1994"},{"key":"10.1016\/0004-3702(95)00111-5_BIB28","series-title":"Change of Representation and Inductive Bias","first-page":"81","article-title":"A theory of abstraction for hierarchical planning","author":"Knoblock","year":"1990"},{"key":"10.1016\/0004-3702(95)00111-5_BIB29","article-title":"Automatically generating abstractions for problem solving","author":"Knoblock","year":"1991"},{"key":"10.1016\/0004-3702(95)00111-5_BIB30","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0004-3702(94)90069-8","article-title":"Automatically generating abstractions for planning","volume":"68","author":"Knoblock","year":"1994","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00111-5_BIB31","series-title":"Proceedings AAAI-91","first-page":"541","article-title":"Integrating abstraction and explanation-based learning in PRODIGY","author":"Knoblock","year":"1991"},{"key":"10.1016\/0004-3702(95)00111-5_BIB32","series-title":"Proceedings AAAI-91","first-page":"692","article-title":"Characterizing abstraction hierarchies for planning","author":"Knoblock","year":"1991"},{"key":"10.1016\/0004-3702(95)00111-5_BIB33","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(80)90033-8","article-title":"Towards a model of representation changes","volume":"14","author":"Korf","year":"1980","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00111-5_BIB34","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0004-3702(85)90012-8","article-title":"Macro-operators: a weak method for learning","volume":"26","author":"Korf","year":"1985","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00111-5_BIB35","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":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00111-5_BIB36","series-title":"Proceedings AAAI-91","first-page":"634","article-title":"Systematic nonlinear planning","author":"McAllester","year":"1991"},{"key":"10.1016\/0004-3702(95)00111-5_BIB37","series-title":"Computers and Thought","first-page":"406","article-title":"Steps toward artificial intelligence","author":"Minsky","year":"1963"},{"key":"10.1016\/0004-3702(95)00111-5_BIB38","series-title":"Proceedings IJCAI-85","first-page":"596","article-title":"Selectively generalizing plans for problem solving","author":"Minton","year":"1985"},{"key":"10.1016\/0004-3702(95)00111-5_BIB39","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0004-3702(90)90059-9","article-title":"Quantitative results concerning the utility of explanation-based learning","volume":"42","author":"Minton","year":"1990","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00111-5_BIB40","series-title":"Computers and Thought","first-page":"269","article-title":"GPS, a program that simulates human thought","author":"Newell","year":"1963"},{"key":"10.1016\/0004-3702(95)00111-5_BIB41","author":"Nilsson","year":"1980"},{"key":"10.1016\/0004-3702(95)00111-5_BIB42","author":"Pearl","year":"1984"},{"key":"10.1016\/0004-3702(95)00111-5_BIB43","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0004-3702(70)90007-X","article-title":"Heuristic search viewed as path finding in a graph","volume":"1","author":"Pohl","year":"1970","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00111-5_BIB44","first-page":"127","article-title":"Bi-directional search","volume":"6","author":"Pohl","year":"1971"},{"key":"10.1016\/0004-3702(95)00111-5_BIB45","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0004-3702(90)90041-W","article-title":"Concept learning and heuristic classification in weak-theory domains","volume":"45","author":"Porter","year":"1990","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00111-5_BIB46","series-title":"Proceedings of the Workshop on Change of Representation and Problem Reformulation","first-page":"153","article-title":"Becoming reactive by concretization","author":"Prieditis","year":"1992"},{"key":"10.1016\/0004-3702(95)00111-5_BIB47","series-title":"Proceedings AAAI-93","first-page":"743","article-title":"Generating effective admissible heuristics by abstraction and reconstitution","author":"Prieditis","year":"1993"},{"key":"10.1016\/0004-3702(95)00111-5_BIB48","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1109\/34.297950","article-title":"Enhanced iterative-deepening search","volume":"16","author":"Reinefeld","year":"1994","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/0004-3702(95)00111-5_BIB49","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0004-3702(74)90026-5","article-title":"Planning in a hierarchy of abstraction spaces","volume":"5","author":"Sacerdoti","year":"1974","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00111-5_BIB50","series-title":"Proceedings IJCAI-89","first-page":"297","article-title":"Fast recursive formulations for best-first search that allow controlled use of memory","author":"Sen","year":"1989"},{"key":"10.1016\/0004-3702(95)00111-5_BIB51","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0020-0255(84)90009-4","article-title":"A result on the computational complexity of heuristic estimates for the A\u2217 algorithm","volume":"34","author":"Valtorta","year":"1984","journal-title":"Inform. Sci."},{"key":"10.1016\/0004-3702(95)00111-5_BIB52","series-title":"Proceedings AAAI-90","first-page":"204","article-title":"Abtweak: abstracting a nonlinear, least commitment planner","author":"Yang","year":"1990"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295001115?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295001115?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T21:57:13Z","timestamp":1555538233000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370295001115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":52,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0004370295001115"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(95)00111-5","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}