[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_250":251},"routes/_layout",{"_11":170},"routes/entity.$type.$id",{"_11":12,"_13":14,"_15":16,"_17":18,"_19":20,"_21":22,"_23":24,"_25":26,"_27":28},"dehydratedState",{"_72":73,"_74":75},"type","paper","id","paper_W2045526507","section","authors","entity",{"_15":16,"_29":30,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":38,"_39":-5,"_40":41,"_42":43,"_44":45,"_46":47,"_48":-5,"_49":50,"_51":30,"_52":53,"_54":55,"_56":57,"_58":59,"_60":61,"_18":-5,"_62":63,"_64":-5,"_65":66,"_67":30,"_68":-5},"canonical","https://www.hugmap.com/entity/paper/paper_W2045526507/authors","siteBaseUrl","https://www.hugmap.com","sectionCount",2,"jsonLd","{\"@context\":\"https://schema.org\",\"@graph\":[{\"name\":\"COMPLEXITY RESULTS FOR SAS⁺ PLANNING\",\"url\":\"https://www.hugmap.com/entity/paper/paper_W2045526507/authors\",\"@type\":\"ScholarlyArticle\",\"headline\":\"COMPLEXITY RESULTS FOR SAS⁺ PLANNING\",\"datePublished\":\"1995-11-01\",\"isPartOf\":{\"@type\":\"Periodical\",\"name\":\"Computational Intelligence\"}},{\"@type\":\"CollectionPage\",\"name\":\"COMPLEXITY RESULTS FOR SAS⁺ PLANNING 作者\",\"description\":\"COMPLEXITY RESULTS FOR SAS⁺ PLANNING 在 HugMap 中的作者，共 2 条，含结构化关联信息与详情链接。\",\"url\":\"https://www.hugmap.com/entity/paper/paper_W2045526507/authors\",\"inLanguage\":\"zh-CN\"},{\"@type\":\"BreadcrumbList\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"首页\",\"item\":\"https://www.hugmap.com/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"论文\",\"item\":\"https://www.hugmap.com/search?type=paper\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"COMPLEXITY RESULTS FOR SAS⁺ PLANNING\",\"item\":\"https://www.hugmap.com/entity/paper/paper_W2045526507\"},{\"@type\":\"ListItem\",\"position\":4,\"name\":\"作者\",\"item\":\"https://www.hugmap.com/entity/paper/paper_W2045526507/authors\"}]}]}","name","COMPLEXITY RESULTS FOR SAS⁺ PLANNING","nameZh","aliases","description","descriptionZh","status","active","externalIds","{\"openalex\":\"W2045526507\",\"doi\":\"10.1111/j.1467-8640.1995.tb00052.x\"}","properties","source","openalex","createdAt","2026-05-19T15:59:23.192013267","updatedAt","2026-05-19T15:59:23.192485891","doi","10.1111/j.1467-8640.1995.tb00052.x","arxivId","openalexId","W2045526507","title","abstractText","We have previously reported a number of tractable planning problems defined in the SAS + formalism. This article complements these results by providing a complete map over the complexity of SAS + planning under all combinations of the previously considered restrictions. We analyze the complexity of both finding a minimal plan and finding any plan. In contrast to other complexity surveys of planning, we study not only the complexity of the decision problems but also the complexity of the generation problems. We prove that the SAS + ‐PUS problem is the maximal tractable problem under the restrictions we have considered if we want to generate minimal plans. If we are satisfied with any plan, then we can generalize further to the SAS + ‐US problem, which we prove to be the maximal tractable problem in this case.","publishedDate","1995-11-01","publishedYear",1995,"venue","Computational Intelligence","citationCount",398,"keywords",[69,70,71],"pdfUrl","topVenue",false,"displayName","displayDescription","AI-based Problem Solving and Planning","Semantic Web and Ontologies","Rough Sets and Fuzzy Logic","mutations",[],"queries",[76],{"_77":78,"_79":80,"_81":82,"_83":84},"dehydratedAt",1783400698643,"state",{"_86":87,"_88":89,"_90":78,"_91":-5,"_92":93,"_94":93,"_95":93,"_96":-5,"_97":-5,"_98":66,"_35":99,"_100":101},"queryKey",[85,19,14,16],"queryHash","[\"portal\",\"entity\",\"paper\",\"paper_W2045526507\"]","portal","data",{"_19":20,"_102":103,"_104":105,"_106":107,"_108":109,"_110":111,"_18":112},"dataUpdateCount",1,"dataUpdatedAt","error","errorUpdateCount",0,"errorUpdatedAt","fetchFailureCount","fetchFailureReason","fetchMeta","isInvalidated","success","fetchStatus","idle","entityType","Paper","taxonomies",[138,139,140],"events",[],"articles",[],"technologies",[],[113,114],{"_15":130,"_29":131,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":132,"_39":-5,"_40":133,"_42":134,"_44":135,"_120":136,"_51":-5,"_122":-5,"_123":-5,"_124":-5,"_60":-5,"_125":137,"_126":-5,"_127":-5,"_128":-5,"_129":-5,"_67":131,"_68":-5},{"_15":115,"_29":116,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":117,"_39":-5,"_40":41,"_42":118,"_44":119,"_120":121,"_51":-5,"_122":-5,"_123":-5,"_124":-5,"_60":-5,"_125":-5,"_126":-5,"_127":-5,"_128":-5,"_129":-5,"_67":116,"_68":-5},"person_A5088263183","Christer Bäckström","{\"openalex\":\"A5088263183\",\"orcid\":\"0000-0002-0866-8780\"}","2026-05-19T15:59:24.18040514","2026-05-23T03:42:13.214982502","orcid","0000-0002-0866-8780","affiliation","researchArea","paperCount","homepage","linkedin","twitter","github","hindex","person_A5002446890","Bernhard Nebel","{\"openalex\":\"A5002446890\",\"orcid\":\"0000-0002-6833-6323\"}","openalex,wikidata","2026-05-14T05:06:29.461165194","2026-05-23T03:42:13.236921685","0000-0002-6833-6323","http://www.informatik.uni-freiburg.de/~nebel",{"_15":165,"_29":70,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":166,"_39":-5,"_40":41,"_42":167,"_44":168,"_145":146,"_147":-5,"_148":149,"_150":163,"_152":169,"_154":93,"_155":156,"_157":93,"_158":-5,"_67":70,"_68":-5},{"_15":159,"_29":69,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":160,"_39":-5,"_40":41,"_42":161,"_44":162,"_145":146,"_147":-5,"_148":149,"_150":163,"_152":164,"_154":93,"_155":156,"_157":93,"_158":-5,"_67":69,"_68":-5},{"_15":141,"_29":71,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":142,"_39":-5,"_40":41,"_42":143,"_44":144,"_145":146,"_147":-5,"_148":149,"_150":151,"_152":153,"_154":93,"_155":156,"_157":93,"_158":-5,"_67":71,"_68":-5},"tax_rd_T11063","{\"openalex_topic\":\"T11063\"}","2026-05-14T00:38:11.363138735","2026-05-23T12:38:17.244444401","taxonomyType","RESEARCH_DOMAIN","code","level",3,"parentId","tax_rd_1703","path","Physical Sciences/Computer Science/Computational Theory and Mathematics/Rough Sets and Fuzzy Logic","sortOrder","isLeaf",true,"entityCount","children","tax_rd_T10906","{\"openalex_topic\":\"T10906\"}","2026-05-14T00:33:45.200970632","2026-05-23T11:40:08.203956262","tax_rd_1702","Physical Sciences/Computer Science/Artificial Intelligence/AI-based Problem Solving and Planning","tax_rd_T10215","{\"openalex_topic\":\"T10215\"}","2026-05-14T00:28:06.268051932","2026-05-23T12:39:42.228471724","Physical Sciences/Computer Science/Artificial Intelligence/Semantic Web and Ontologies",{"_72":171,"_74":172},[],[173],{"_77":174,"_79":175,"_81":176,"_83":177},1783400694053,{"_86":179,"_88":89,"_90":174,"_91":-5,"_92":93,"_94":93,"_95":93,"_96":-5,"_97":-5,"_98":66,"_35":99,"_100":101},[85,178],"[\"portal\",\"industries\"]","industries",[180,181,182,183,184,185,186,187,188,189,190,191],{"_15":243,"_29":244,"_31":-5,"_32":245,"_33":246,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":195,"_42":-5,"_44":-5,"_145":196,"_147":-5,"_148":89,"_150":197,"_152":247,"_154":93,"_155":66,"_157":93,"_158":-5,"_67":244,"_68":246},{"_15":239,"_29":240,"_31":-5,"_32":-5,"_33":241,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":195,"_42":-5,"_44":-5,"_145":196,"_147":-5,"_148":89,"_150":197,"_152":242,"_154":93,"_155":66,"_157":93,"_158":-5,"_67":240,"_68":241},{"_15":233,"_29":234,"_31":-5,"_32":235,"_33":236,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":195,"_42":-5,"_44":-5,"_145":196,"_147":-5,"_148":89,"_150":197,"_152":237,"_154":93,"_155":66,"_157":93,"_158":-5,"_67":234,"_68":236},{"_15":229,"_29":230,"_31":-5,"_32":-5,"_33":231,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":195,"_42":-5,"_44":-5,"_145":196,"_147":-5,"_148":89,"_150":197,"_152":232,"_154":93,"_155":66,"_157":93,"_158":-5,"_67":230,"_68":231},{"_15":225,"_29":226,"_31":-5,"_32":-5,"_33":227,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":195,"_42":-5,"_44":-5,"_145":196,"_147":-5,"_148":89,"_150":197,"_152":228,"_154":93,"_155":66,"_157":93,"_158":-5,"_67":226,"_68":227},{"_15":219,"_29":220,"_31":-5,"_32":221,"_33":222,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":195,"_42":-5,"_44":-5,"_145":196,"_147":-5,"_148":89,"_150":197,"_152":223,"_154":93,"_155":66,"_157":93,"_158":-5,"_67":220,"_68":222},{"_15":215,"_29":216,"_31":-5,"_32":-5,"_33":217,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":195,"_42":-5,"_44":-5,"_145":196,"_147":-5,"_148":89,"_150":197,"_152":218,"_154":93,"_155":156,"_157":93,"_158":-5,"_67":216,"_68":217},{"_15":211,"_29":212,"_31":-5,"_32":-5,"_33":213,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":195,"_42":-5,"_44":-5,"_145":196,"_147":-5,"_148":89,"_150":197,"_152":214,"_154":93,"_155":66,"_157":93,"_158":-5,"_67":212,"_68":213},{"_15":207,"_29":208,"_31":-5,"_32":-5,"_33":209,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":195,"_42":-5,"_44":-5,"_145":196,"_147":-5,"_148":89,"_150":197,"_152":210,"_154":93,"_155":66,"_157":93,"_158":-5,"_67":208,"_68":209},{"_15":203,"_29":204,"_31":-5,"_32":-5,"_33":205,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":195,"_42":-5,"_44":-5,"_145":196,"_147":-5,"_148":89,"_150":197,"_152":206,"_154":93,"_155":66,"_157":93,"_158":-5,"_67":204,"_68":205},{"_15":199,"_29":200,"_31":-5,"_32":-5,"_33":201,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":195,"_42":-5,"_44":-5,"_145":196,"_147":-5,"_148":89,"_150":197,"_152":202,"_154":93,"_155":66,"_157":93,"_158":-5,"_67":200,"_68":201},{"_15":192,"_29":193,"_31":-5,"_32":-5,"_33":194,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":195,"_42":-5,"_44":-5,"_145":196,"_147":-5,"_148":89,"_150":197,"_152":198,"_154":93,"_155":66,"_157":93,"_158":-5,"_67":193,"_68":194},"tax_ind_smartphone","智能手机","Smartphone","manual","INDUSTRY","tax_ind_root","科技行业/智能手机","tax_ind_robot","机器人","Robotics","科技行业/机器人","tax_ind_wearable","智能穿戴","Smart Wearables","科技行业/智能穿戴","tax_ind_energy","新能源与智能制造","New Energy & Smart Manufacturing","科技行业/新能源与智能制造","tax_ind_biotech","生物科技","Biotech","科技行业/生物科技","tax_ind_quantum","量子计算","Quantum Computing","科技行业/量子计算","tax_ind_blockchain","区块链",[224],"Blockchain","科技行业/区块链","Web3","tax_ind_enterprise","企业软件","Enterprise Software","科技行业/企业软件","tax_ind_security","网络安全","Cybersecurity","科技行业/网络安全","tax_ind_semi","半导体",[238],"Semiconductor","科技行业/半导体","芯片","tax_ind_cloud","云计算","Cloud Computing","科技行业/云计算","tax_ind_ai","人工智能",[248,249],"Artificial Intelligence","科技行业/人工智能","AI","AI 技术","env",{"_252":24},"SITE_BASE_URL"]

COMPLEXITY RESULTS FOR SAS<sup>+</sup> PLANNING 论文

COMPLEXITY RESULTS FOR SAS<sup>+</sup> PLANNING · 作者