{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T10:46:27Z","timestamp":1762339587834},"reference-count":28,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"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":6355,"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,3]]},"DOI":"10.1016\/0004-3702(95)00055-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:24:09Z","timestamp":1027657449000},"page":"241-271","source":"Crossref","is-referenced-by-count":12,"title":["A probabilistic analysis of prepositional STRIPS planning"],"prefix":"10.1016","volume":"81","author":[{"given":"Tom","family":"Bylander","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(95)00055-0_BIB1","series-title":"Proceedings IJCAI-91","first-page":"268","article-title":"Parallel non-binary planning in polynomial time","author":"B\u00e4ckstr\u00f6m","year":"1991"},{"key":"10.1016\/0004-3702(95)00055-0_BIB2","series-title":"Proceedings IJCAI-91","first-page":"274","article-title":"Complexity results for planning","author":"Bylander","year":"1991"},{"key":"10.1016\/0004-3702(95)00055-0_BIB3","series-title":"Proceedings AAAI-93","first-page":"480","article-title":"An average case analysis of planning","author":"Bylander","year":"1993"},{"key":"10.1016\/0004-3702(95)00055-0_BIB4","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(94)90081-7","article-title":"The computational complexity of prepositional STRIPS planning","volume":"69","author":"Bylander","year":"1994","journal-title":"Artif. Intell."},{"issue":"3","key":"10.1016\/0004-3702(95)00055-0_BIB5_1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0004-3702(87)90092-0","article-title":"Planning for conjunctive goals","volume":"32","author":"Chapman","year":"1987","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00055-0_BIB5_2","series-title":"Readings in Planning","year":"1990"},{"key":"10.1016\/0004-3702(95)00055-0_BIB6","series-title":"Proceedings IJCAI-91","first-page":"331","article-title":"Where the really hard problems are","author":"Cheeseman","year":"1991"},{"issue":"1","key":"10.1016\/0004-3702(95)00055-0_BIB7","first-page":"17","article-title":"A survey of the Eighth National Conference on Artificial Intelligence: pulling together or pulling apart?","volume":"12","author":"Cohen","year":"1991","journal-title":"AI Mag."},{"key":"10.1016\/0004-3702(95)00055-0_BIB8","author":"Cormen","year":"1990"},{"key":"10.1016\/0004-3702(95)00055-0_BIB9","series-title":"Proceedings AAAI-93","first-page":"46","article-title":"Experimental results on the crossover point in satisfiability problems","author":"Crawford","year":"1993"},{"key":"10.1016\/0004-3702(95)00055-0_BIB10","series-title":"Proceedings AAAI-92","first-page":"381","article-title":"On the complexity of domain-independent planning","author":"Erol","year":"1992"},{"key":"10.1016\/0004-3702(95)00055-0_BIB11","series-title":"Proceedings First International Conference on AI Planning Systems","first-page":"222","article-title":"When is planning decidable?","author":"Erol","year":"1992"},{"issue":"3\/4","key":"10.1016\/0004-3702(95)00055-0_BIB12_1","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)00055-0_BIB12_2","series-title":"Readings in Planning","year":"1990"},{"key":"10.1016\/0004-3702(95)00055-0_BIB13","author":"Garey","year":"1979"},{"issue":"1\u20132","key":"10.1016\/0004-3702(95)00055-0_BIB14","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0004-3702(90)90040-7","article-title":"Explaining and repairing plans that fail","volume":"45","author":"Hammond","year":"1990","journal-title":"Artif. Intell."},{"issue":"2\u20133","key":"10.1016\/0004-3702(95)00055-0_BIB15","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0004-3702(92)90056-4","article-title":"A validation-structure-based theory of plan modification and reuse","volume":"55","author":"Kambhampati","year":"1992","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00055-0_BIB16","series-title":"Proceedings AAAI-91","first-page":"634","article-title":"Systematic nonlinear planning","author":"McAllester","year":"1991"},{"issue":"2","key":"10.1016\/0004-3702(95)00055-0_BIB17","first-page":"34","article-title":"Logical versus analogical or symbolic versus connectionist or neat versus scruffy","volume":"12","author":"Minsky","year":"1991","journal-title":"AI Mag."},{"key":"10.1016\/0004-3702(95)00055-0_BIB18","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","article-title":"Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems","volume":"58","author":"Minton","year":"1992","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00055-0_BIB19","series-title":"Proceedings AAAI-92","first-page":"459","article-title":"Hard and easy distributions of SAT problems","author":"Mitchell","year":"1992"},{"key":"10.1016\/0004-3702(95)00055-0_BIB20","series-title":"Proceedings AAAI-92","first-page":"466","article-title":"How long will it take?","author":"Musick","year":"1992"},{"key":"10.1016\/0004-3702(95)00055-0_BIB21","series-title":"Proceedings IJCAI-93","first-page":"1436","article-title":"Plan modification versus plan generation: a complexity-theoretic perspective","author":"Nebel","year":"1993"},{"key":"10.1016\/0004-3702(95)00055-0_BIB22","author":"Nilsson","year":"1980"},{"key":"10.1016\/0004-3702(95)00055-0_BIB23","series-title":"Proceedings Third International Conference on Principles of Knowledge Representation and Reasoning","first-page":"103","article-title":"UCPOP: a sound, complete, partial order planning for ADL","author":"Penberthy","year":"1992"},{"key":"10.1016\/0004-3702(95)00055-0_BIB24","series-title":"Proceedings AAAI-93","first-page":"46","article-title":"An empirical study of greedy local search for satisfiability testing","author":"Selman","year":"1993"},{"key":"10.1016\/0004-3702(95)00055-0_BIB25","series-title":"Proceedings AAAI-92","first-page":"440","article-title":"A new method for solving hard satisfiability problems","author":"Selman","year":"1992"},{"key":"10.1016\/0004-3702(95)00055-0_BIB26","series-title":"Proceedings AAAI-92","first-page":"472","article-title":"Using deep structure to locate hard problems","author":"Williams","year":"1992"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000550?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000550?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T10:27:31Z","timestamp":1555064851000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370295000550"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0004370295000550"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(95)00055-0","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}