{"id":"https://openalex.org/W76361982","doi":null,"title":"The complexity of optimal planning and a more efficient method for finding solutions","display_name":"The complexity of optimal planning and a more efficient method for finding solutions","publication_year":2008,"publication_date":"2008-09-14","ids":{"openalex":"https://openalex.org/W76361982","mag":"76361982"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.666.9564","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.666.9564","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.aaai.org/Papers/ICAPS/2008/ICAPS08-035.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028368896","display_name":"Katrina J. Ray","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I181233156","display_name":"University of Oregon","ror":"https://ror.org/0293rh119","country_code":"US","type":"education","lineage":["https://openalex.org/I181233156"]},{"id":"https://openalex.org/I4210119708","display_name":"On Time Systems (United States)","ror":"https://ror.org/02d21wr69","country_code":"US","type":"company","lineage":["https://openalex.org/I4210119708"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Katrina J. Ray","raw_affiliation_strings":["University of Oregon CIRL and On Time Systems, Eugene, OR#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oregon CIRL and On Time Systems, Eugene, OR#TAB#","institution_ids":["https://openalex.org/I181233156","https://openalex.org/I4210119708"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111085193","display_name":"Matthew L. Ginsberg","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I181233156","display_name":"University of Oregon","ror":"https://ror.org/0293rh119","country_code":"US","type":"education","lineage":["https://openalex.org/I181233156"]},{"id":"https://openalex.org/I4210119708","display_name":"On Time Systems (United States)","ror":"https://ror.org/02d21wr69","country_code":"US","type":"company","lineage":["https://openalex.org/I4210119708"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matthew L. Ginsberg","raw_affiliation_strings":["University of Oregon CIRL and On Time Systems, Eugene, OR#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oregon CIRL and On Time Systems, Eugene, OR#TAB#","institution_ids":["https://openalex.org/I181233156","https://openalex.org/I4210119708"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3303,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.88944845,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"280","last_page":"287"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9312000274658203,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9312000274658203,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.05000000074505806,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.007400000002235174,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/optimal-planning","display_name":"optimal planning","score":0.9980000257492065},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.6690000295639038},{"id":"https://openalex.org/keywords/sat-solvers","display_name":"SAT solvers","score":0.609000027179718},{"id":"https://openalex.org/keywords/dpll","display_name":"DPLL","score":0.5389999747276306},{"id":"https://openalex.org/keywords/descriptive-complexity","display_name":"descriptive complexity","score":0.31200000643730164}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.8135260343551636},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6236857771873474},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5849805474281311},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5674806833267212},{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.5430076122283936},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5405418276786804},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5246396660804749},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.4995877742767334},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.48052939772605896},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.477967232465744},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4620261788368225},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.44966262578964233},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41433730721473694},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3494807183742523},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31423670053482056},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27229321002960205},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08196640014648438},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.666.9564","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.666.9564","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.aaai.org/Papers/ICAPS/2008/ICAPS08-035.pdf","raw_type":"text"},{"id":"mag:76361982","doi":null,"is_oa":false,"landing_page_url":"http://aaaipress.org/Papers/ICAPS/2008/ICAPS08-035.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419157","display_name":"International Conference on Automated Planning and Scheduling","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Automated Planning and Scheduling","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W141377150","https://openalex.org/W1494190982","https://openalex.org/W1571893670","https://openalex.org/W1572277334","https://openalex.org/W1667362966","https://openalex.org/W1748017702","https://openalex.org/W1923495615","https://openalex.org/W2057361103","https://openalex.org/W2062897452","https://openalex.org/W2072181151","https://openalex.org/W2142785340","https://openalex.org/W2165661129","https://openalex.org/W2217970314","https://openalex.org/W2346933546"],"related_works":["https://openalex.org/W7101185670","https://openalex.org/W7097733477","https://openalex.org/W7056764951","https://openalex.org/W7100576679","https://openalex.org/W7098893638","https://openalex.org/W1531639447","https://openalex.org/W7098003235","https://openalex.org/W2135381560","https://openalex.org/W7100481106","https://openalex.org/W48982439"],"abstract_inverted_index":{"We":[0,61,113],"present":[1],"a":[2,26,39,51,55,67,77,81,129,144,163,176],"faster":[3,22],"method":[4],"of":[5,20,28,142,153,175],"solving":[6],"optimal":[7,117,131,169],"planning":[8,118,132,170],"problems":[9,29,171],"and":[10,155],"show":[11,161],"that":[12,76,96,103,116,158,162],"our":[13,63],"solution":[14],"performs":[15],"up":[16],"to":[17,38,54,74,80,86,100],"an":[18],"order":[19],"magnitude":[21],"than":[23,110,136],"Satplan":[24,34],"on":[25,179],"variety":[27],"from":[30],"the":[31,123,140,147,150,156,173],"IPC-5":[32],"benchmarks.":[33],"makes":[35],"several":[36],"calls":[37],"SAT":[40,56,82,104,137],"solver,":[41,57],"discarding":[42],"learned":[43],"information":[44],"with":[45],"each":[46],"call.":[47],"Our":[48],"planner":[49],"uses":[50],"single":[52,78,164],"call":[53,79,166],"eliminating":[58],"this":[59],"problem.":[60],"explain":[62],"technique":[64],"by":[65,128],"describing":[66],"new":[68],"theoretical":[69],"framework":[70],"which":[71],"allows":[72],"us":[73],"prove":[75,115],"solver":[83],"is":[84,98,119,126,133],"sufficient":[85],"solve":[87,168],"every":[88],"problem":[89],"in":[90,139,172],"\u22062.":[91],"(This":[92],"does":[93],"not":[94],"imply":[95],"NP":[97],"equal":[99],"\u22062;":[101],"only":[102],"solvers":[105],"\u2019":[106],"capabilities":[107],"are":[108],"greater":[109],"previously":[111],"realized.)":[112],"also":[114],"F\u03982":[120],"Complete":[121],"when":[122],"plan":[124,180],"length":[125],"bounded":[127],"polynomial;":[130],"thus":[134],"harder":[135],"even":[138],"presence":[141,174],"such":[143],"bound.":[145],"Despite":[146],"relative":[148],"complexities,":[149],"\u22062":[151,160],"capability":[152],"DPLL":[154],"fact":[157],"\u03982":[159],"satisfiability":[165],"can":[167],"polynomial":[177],"bound":[178],"length.":[181]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}