{"id":"https://openalex.org/W4414359189","doi":"https://doi.org/10.24963/ijcai.2025/1219","title":"Decoupled Search for the Masses: A Novel Task Transformation for Classical Planning (Extended Abstract)","display_name":"Decoupled Search for the Masses: A Novel Task Transformation for Classical Planning (Extended Abstract)","publication_year":2025,"publication_date":"2025-09-01","ids":{"openalex":"https://openalex.org/W4414359189","doi":"https://doi.org/10.24963/ijcai.2025/1219"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2025/1219","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2025/1219","pdf_url":"https://www.ijcai.org/proceedings/2025/1219.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2025/1219.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030844531","display_name":"David Speck","orcid":"https://orcid.org/0000-0002-5493-7363"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]},{"id":"https://openalex.org/I1850255","display_name":"University of Basel","ror":"https://ror.org/02s6k3f65","country_code":"CH","type":"education","lineage":["https://openalex.org/I1850255"]}],"countries":["CH","SE"],"is_corresponding":false,"raw_author_name":"David Speck","raw_affiliation_strings":["Link\u00f6ping University","University of Basel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Link\u00f6ping University","institution_ids":["https://openalex.org/I102134673"]},{"raw_affiliation_string":"University of Basel","institution_ids":["https://openalex.org/I1850255"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088566339","display_name":"Daniel Gnad","orcid":"https://orcid.org/0000-0001-7434-2669"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]},{"id":"https://openalex.org/I223822909","display_name":"Heidelberg University","ror":"https://ror.org/038t36y30","country_code":"DE","type":"education","lineage":["https://openalex.org/I223822909"]}],"countries":["DE","SE"],"is_corresponding":false,"raw_author_name":"Daniel Gnad","raw_affiliation_strings":["Heidelberg University","Link\u00f6ping University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Heidelberg University","institution_ids":["https://openalex.org/I223822909"]},{"raw_affiliation_string":"Link\u00f6ping University","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20692159,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"10932","last_page":"10936"},"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.8543999791145325,"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.8543999791145325,"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/T10126","display_name":"Logic, programming, and type systems","score":0.8273000121116638,"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.7350000143051147,"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/task","display_name":"Task (project management)","score":0.6439999938011169},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5878000259399414},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.574400007724762},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5681999921798706},{"id":"https://openalex.org/keywords/transformation","display_name":"Transformation (genetics)","score":0.5074999928474426},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.44600000977516174},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4113999903202057},{"id":"https://openalex.org/keywords/search-problem","display_name":"Search problem","score":0.34630000591278076}],"concepts":[{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6439999938011169},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5878000259399414},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.574400007724762},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5681999921798706},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5285999774932861},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.5074999928474426},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.44600000977516174},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42669999599456787},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41200000047683716},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4113999903202057},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3853999972343445},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.361299991607666},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.34630000591278076},{"id":"https://openalex.org/C165443888","wikidata":"https://www.wikidata.org/wiki/Q1482183","display_name":"Transformation matrix","level":3,"score":0.3327000141143799},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.30140000581741333},{"id":"https://openalex.org/C114073186","wikidata":"https://www.wikidata.org/wiki/Q2631895","display_name":"Automated planning and scheduling","level":2,"score":0.29919999837875366},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.29809999465942383},{"id":"https://openalex.org/C53051483","wikidata":"https://www.wikidata.org/wiki/Q861555","display_name":"Cube (algebra)","level":2,"score":0.29109999537467957},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2703999876976013},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.26759999990463257},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.26489999890327454},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.26190000772476196}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2025/1219","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2025/1219","pdf_url":"https://www.ijcai.org/proceedings/2025/1219.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2025/1219","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2025/1219","pdf_url":"https://www.ijcai.org/proceedings/2025/1219.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4632909464","display_name":null,"funder_award_id":"2022-06725","funder_id":"https://openalex.org/F4320322327","funder_display_name":"Knut och Alice Wallenbergs Stiftelse"},{"id":"https://openalex.org/G5423436380","display_name":null,"funder_award_id":"2022-06725","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7318745325","display_name":null,"funder_award_id":"2022-06725","funder_id":"https://openalex.org/F4320336380","funder_display_name":"National Supercomputer Centre, Link\u00f6pings Universitet"},{"id":"https://openalex.org/G8436673617","display_name":null,"funder_award_id":"2022-06725","funder_id":"https://openalex.org/F4320322225","funder_display_name":"Link\u00f6pings Universitet"},{"id":"https://openalex.org/G8869864247","display_name":"NAISS","funder_award_id":"2022-06725","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"},{"id":"https://openalex.org/F4320322225","display_name":"Link\u00f6pings Universitet","ror":"https://ror.org/05ynxx418"},{"id":"https://openalex.org/F4320322327","display_name":"Knut och Alice Wallenbergs Stiftelse","ror":"https://ror.org/004hzzk67"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"},{"id":"https://openalex.org/F4320336380","display_name":"National Supercomputer Centre, Link\u00f6pings Universitet","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414359189.pdf","grobid_xml":"https://content.openalex.org/works/W4414359189.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Classical":[0],"planning":[1,62,94],"provides":[2],"a":[3,12,25,29,38,81,89,101,125,143],"framework":[4],"for":[5,73],"solving":[6,64],"sequential":[7],"decision-making":[8],"problems,":[9],"i.e.,":[10],"finding":[11,71],"sequence":[13],"of":[14,21,61],"actions":[15],"that":[16,27,40,51,85,117],"transforms":[17],"the":[18,22,42,52,59,67],"current":[19],"state":[20,26],"world":[23],"into":[24],"satisfies":[28],"desired":[30],"goal":[31],"condition.":[32],"Planning":[33],"tasks":[34],"are":[35],"modeled":[36],"in":[37],"logic":[39],"describes":[41],"environment":[43],"and":[44,95,128,138],"its":[45,106],"dynamics.":[46],"It":[47],"is":[48],"well":[49],"known":[50],"specific":[53],"problem":[54,83,103],"formulation":[55],"can":[56,120],"significantly":[57],"affect":[58],"performance":[60],"systems":[63],"problems":[65],"like":[66],"Rubik's":[68],"Cube":[69],"or":[70],"algorithms":[72],"matrix":[74],"multiplication.":[75],"In":[76],"this":[77],"work,":[78],"we":[79],"propose":[80],"domain-general":[82],"reformulation":[84,127],"embodies":[86],"decoupled":[87,118],"search,":[88],"search-reduction":[90],"technique":[91],"from":[92],"classical":[93],"model":[96],"checking.":[97],"Decoupled":[98],"search":[99,113,119],"decomposes":[100],"given":[102],"to":[104],"exploit":[105],"structure,":[107],"achieving":[108],"exponential":[109],"reductions":[110],"over":[111],"other":[112],"techniques.":[114],"We":[115],"show":[116],"be":[121],"captured":[122],"exactly":[123],"as":[124,136],"task":[126],"that,":[129],"on":[130],"many":[131],"benchmark":[132],"domains,":[133],"it":[134],"performs":[135],"good":[137],"sometimes":[139],"even":[140],"better":[141],"than":[142],"native":[144],"decoupled-search":[145],"implementation.":[146]},"counts_by_year":[],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}