{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T21:06:35Z","timestamp":1771016795191,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"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":4649,"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":[[2000,11]]},"DOI":"10.1016\/s0004-3702(00)00063-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:41:58Z","timestamp":1027593718000},"page":"1-30","source":"Crossref","is-referenced-by-count":16,"title":["An efficient algorithm for searching implicit AND\/OR graphs with cycles"],"prefix":"10.1016","volume":"124","author":[{"given":"P.","family":"Jim\u00e9nez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Torras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(00)00063-1_ID003","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/0377-2217(95)00026-M","article-title":"An AND\/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems","volume":"Vol. 84","author":"Arenales","year":"1995","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0004-3702(00)00063-1_ID004","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0304-3975(83)90050-6","article-title":"Admissible heuristic search in AND\/OR graphs","volume":"Vol. 24","author":"Bagchi","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0004-3702(00)00063-1_ID005","series-title":"Proc. 10th IEEE Conference on Artificial Intelligence for Applications, San Antonio, TX","first-page":"428","article-title":"Intelligent reliability analysis","author":"Barnett","year":"1994"},{"issue":"2","key":"10.1016\/S0004-3702(00)00063-1_ID006","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1109\/5326.669552","article-title":"AND\/OR net representation for robotic task sequence planning","volume":"Vol. 28","author":"Cao","year":"1998","journal-title":"IEEE Trans. Systems Man Cybernet.\u2014Part C: Applications and Reviews"},{"key":"10.1016\/S0004-3702(00)00063-1_ID007","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(87)90005-1","article-title":"Admissibility of AO* when heuristics overestimate","volume":"Vol. 34","author":"Chakrabarti","year":"1988","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10.1016\/S0004-3702(00)00063-1_ID008","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":"Vol. 65","author":"Chakrabarti","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00063-1_ID009","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0004-3702(71)90006-3","article-title":"An admissible and optimal algorithm for searching AND\/OR graphs","volume":"Vol. 2","author":"Chang","year":"1971","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10.1016\/S0004-3702(00)00063-1_ID010","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1109\/70.75905","article-title":"A correct and complete algorithm for the generation of mechanical assembly sequences","volume":"Vol. 7","author":"DeMello","year":"1991","journal-title":"IEEE Trans. Robotics and Automation"},{"key":"10.1016\/S0004-3702(00)00063-1_ID011","series-title":"Complexity measures for assembly sequences. Ph.D. Thesis","author":"Goldwasser","year":"1997"},{"key":"10.1016\/S0004-3702(00)00063-1_ID012","series-title":"Proc. IEEE Internat. Conference on Robotics and Automation, Minneapolis, MN, Vol. 2","first-page":"1851","article-title":"Complexity measures for assembly sequences","author":"Goldwasser","year":"1996"},{"key":"10.1016\/S0004-3702(00)00063-1_ID013","series-title":"Proc. Workshop on Algorithms and Data Structures","first-page":"307","article-title":"Intractability of assembly sequencing: Unit disks in the plane","volume":"Vol. 1272","author":"Goldwasser","year":"1997"},{"key":"10.1016\/S0004-3702(00)00063-1_ID014","series-title":"Proc. 3rd Symposium on Operations Research in Slovenia","first-page":"81","article-title":"On the cost of potential solution subgraphs","author":"Hvalica","year":"1995"},{"key":"10.1016\/S0004-3702(00)00063-1_ID015","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1006\/jagm.1996.0039","article-title":"Best first search algorithm in AND\/OR graphs with cycles","volume":"Vol. 21","author":"Hvalica","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/S0004-3702(00)00063-1_ID016","series-title":"Robot Motion Planning and Control","first-page":"305","article-title":"Collision detection algorithms for motion planning","volume":"Vol. 229","author":"Jim\u00e9nez","year":"1998"},{"key":"10.1016\/S0004-3702(00)00063-1_ID017","series-title":"Proc. IEEE Internat. Conference on Robotics and Automation, Minneapolis, MN, Vol. 2","first-page":"1485","article-title":"Speeding up interference detection between polyhedra","author":"Jim\u00e9nez","year":"1996"},{"key":"10.1016\/S0004-3702(00)00063-1_ID018","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0255(91)90023-N","article-title":"A general heuristic bottom-up procedure for searching AND\/OR graphs","volume":"Vol. 56","author":"Kumar","year":"1991","journal-title":"Inform. Sci."},{"issue":"1","key":"10.1016\/S0004-3702(00)00063-1_ID019","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/2455.2459","article-title":"AND\/OR graph heuristic search methods","volume":"Vol. 32","author":"Mahanti","year":"1985","journal-title":"J. ACM"},{"issue":"12","key":"10.1016\/S0004-3702(00)00063-1_ID020","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1145\/359657.359664","article-title":"Optimizing decision trees through heuristically guided search","volume":"Vol. 21","author":"Martelli","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/S0004-3702(00)00063-1_ID021","series-title":"Principles of Artificial Intelligence","author":"Nilsson","year":"1980"},{"issue":"2","key":"10.1016\/S0004-3702(00)00063-1_ID022","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1109\/70.134276","article-title":"Inferring feasible assemblies from spatial constraints","volume":"Vol. 8","author":"Thomas","year":"1992","journal-title":"IEEE Trans. Robotics and Automation"},{"issue":"2","key":"10.1016\/S0004-3702(00)00063-1_ID023","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0004-3702(94)90048-5","article-title":"Geometric reasoning about mechanical assembly","volume":"Vol. 71","author":"Wilson","year":"1994","journal-title":"Artificial Intelligence"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370200000631?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370200000631?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T22:27:33Z","timestamp":1556404053000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370200000631"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["S0004370200000631"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(00)00063-1","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2000,11]]}}}