{"id":"https://openalex.org/W4414223323","doi":"https://doi.org/10.1609/icaps.v35i1.36102","title":"Tight Bounds for Lifted HTN Plan Verification and Bounded Plan Existence","display_name":"Tight Bounds for Lifted HTN Plan Verification and Bounded Plan Existence","publication_year":2025,"publication_date":"2025-09-16","ids":{"openalex":"https://openalex.org/W4414223323","doi":"https://doi.org/10.1609/icaps.v35i1.36102"},"language":"en","primary_location":{"id":"doi:10.1609/icaps.v35i1.36102","is_oa":true,"landing_page_url":"https://doi.org/10.1609/icaps.v35i1.36102","pdf_url":"https://ojs.aaai.org/index.php/ICAPS/article/download/36102/38256","source":{"id":"https://openalex.org/S4387283601","display_name":"Proceedings of the International Conference on Automated Planning and Scheduling","issn_l":"2334-0835","issn":["2334-0835","2334-0843"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Automated Planning and Scheduling","raw_type":"journal-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://ojs.aaai.org/index.php/ICAPS/article/download/36102/38256","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5119628759","display_name":"Pascal Lauer","orcid":null},"institutions":[{"id":"https://openalex.org/I118347636","display_name":"Australian National University","ror":"https://ror.org/019wvm592","country_code":"AU","type":"education","lineage":["https://openalex.org/I118347636"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Pascal Lauer","raw_affiliation_strings":["Australian National University\nSaarland University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Australian National University\nSaarland University","institution_ids":["https://openalex.org/I118347636"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046610355","display_name":"Songtuan Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I118347636","display_name":"Australian National University","ror":"https://ror.org/019wvm592","country_code":"AU","type":"education","lineage":["https://openalex.org/I118347636"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Songtuan Lin","raw_affiliation_strings":["Australian National University\nSaarland University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Australian National University\nSaarland University","institution_ids":["https://openalex.org/I118347636"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009175450","display_name":"Pascal Bercher","orcid":"https://orcid.org/0000-0002-0795-4320"},"institutions":[{"id":"https://openalex.org/I118347636","display_name":"Australian National University","ror":"https://ror.org/019wvm592","country_code":"AU","type":"education","lineage":["https://openalex.org/I118347636"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Pascal Bercher","raw_affiliation_strings":["Australian National University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Australian National University","institution_ids":["https://openalex.org/I118347636"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I118347636"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.29378151,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"35","issue":"1","first_page":"64","last_page":"73"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9904999732971191,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9767000079154968,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/bounded-function","display_name":"Bounded function","score":0.8004999756813049},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.632099986076355},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.6033999919891357},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41119998693466187}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.8004999756813049},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.632099986076355},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.6033999919891357},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5164999961853027},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42899999022483826},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41119998693466187},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40700000524520874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34450000524520874},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30799999833106995},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.24140000343322754}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1609/icaps.v35i1.36102","is_oa":true,"landing_page_url":"https://doi.org/10.1609/icaps.v35i1.36102","pdf_url":"https://ojs.aaai.org/index.php/ICAPS/article/download/36102/38256","source":{"id":"https://openalex.org/S4387283601","display_name":"Proceedings of the International Conference on Automated Planning and Scheduling","issn_l":"2334-0835","issn":["2334-0835","2334-0843"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Automated Planning and Scheduling","raw_type":"journal-article"},{"id":"pmh:oai:openresearch-repository.anu.edu.au:1885/733812170","is_oa":false,"landing_page_url":"https://hdl.handle.net/1885/733812170","pdf_url":null,"source":{"id":"https://openalex.org/S4306402539","display_name":"ANU Open Research (Australian National University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I118347636","host_organization_name":"Australian National University","host_organization_lineage":["https://openalex.org/I118347636"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Proceedings International Conference on Automated Planning and Scheduling, ICAPS","raw_type":"Conference paper"}],"best_oa_location":{"id":"doi:10.1609/icaps.v35i1.36102","is_oa":true,"landing_page_url":"https://doi.org/10.1609/icaps.v35i1.36102","pdf_url":"https://ojs.aaai.org/index.php/ICAPS/article/download/36102/38256","source":{"id":"https://openalex.org/S4387283601","display_name":"Proceedings of the International Conference on Automated Planning and Scheduling","issn_l":"2334-0835","issn":["2334-0835","2334-0843"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Automated Planning and Scheduling","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1951765764","display_name":null,"funder_award_id":"SFB 1102","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G737504480","display_name":"SFB 1102: Informationsdichte und sprachliche Kodierung","funder_award_id":"232722074","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320315885","display_name":"Australian Government","ror":"https://ror.org/0314h5y94"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414223323.pdf","grobid_xml":"https://content.openalex.org/works/W4414223323.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Plan":[0],"verification":[1],"is":[2,15],"a":[3],"canonical":[4],"problem":[5,14],"within":[6],"any":[7],"planning":[8],"setting":[9],"to":[10,18],"ensure":[11],"correctness.":[12],"This":[13,61],"closely":[16],"linked":[17],"the":[19,26,43,53,70,79],"bounded":[20],"plan":[21],"existence":[22,71],"problem.":[23],"We":[24],"analyze":[25],"complexity":[27],"of":[28,42,55,72,82],"these":[29],"problems":[30],"on":[31,49,78],"lifted":[32],"representations":[33],"for":[34],"Hierarchical":[35],"Task":[36],"Network":[37],"(HTN)":[38],"Planning.":[39],"On":[40],"top":[41],"general":[44],"analysis,":[45],"we":[46],"impose":[47],"constraints":[48],"method":[50],"orderings":[51],"and":[52],"amount":[54],"tasks":[56],"that":[57],"methods":[58],"decompose":[59],"to.":[60],"pinpoints":[62],"subclasses":[63],"with":[64],"lower":[65],"complexity.":[66],"Our":[67],"results":[68],"confirm":[69],"more":[73],"efficient":[74],"algorithms":[75],"when":[76],"operating":[77],"lifted,":[80],"instead":[81],"grounded,":[83],"representation.":[84]},"counts_by_year":[],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2025-10-10T00:00:00"}