{"id":"https://openalex.org/W4414222848","doi":"https://doi.org/10.1609/icaps.v35i1.36103","title":"Continuing the Quest for Polynomial Time Heuristics in PDDL Input Size: Tractable Cases for Lifted h\u1d43\u1d48\u1d48","display_name":"Continuing the Quest for Polynomial Time Heuristics in PDDL Input Size: Tractable Cases for Lifted h\u1d43\u1d48\u1d48","publication_year":2025,"publication_date":"2025-09-16","ids":{"openalex":"https://openalex.org/W4414222848","doi":"https://doi.org/10.1609/icaps.v35i1.36103"},"language":"en","primary_location":{"id":"doi:10.1609/icaps.v35i1.36103","is_oa":true,"landing_page_url":"https://doi.org/10.1609/icaps.v35i1.36103","pdf_url":"https://ojs.aaai.org/index.php/ICAPS/article/download/36103/38257","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/36103/38257","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005692369","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":["Saarland University\nAustralian National University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University\nAustralian National University","institution_ids":["https://openalex.org/I118347636"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055606711","display_name":"\u00c1lvaro Torralba","orcid":"https://orcid.org/0000-0002-5352-2529"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"\u00c1lvaro Torralba","raw_affiliation_strings":["Aalborg University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aalborg University","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065705708","display_name":"Daniel H\u00f6ller","orcid":"https://orcid.org/0000-0002-2776-9288"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Daniel H\u00f6ller","raw_affiliation_strings":["Saarland University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076532681","display_name":"J\u00f6rg Hoffmann","orcid":"https://orcid.org/0000-0003-1590-5876"},"institutions":[{"id":"https://openalex.org/I33256026","display_name":"German Research Centre for Artificial Intelligence","ror":"https://ror.org/01ayc5b57","country_code":"DE","type":"funder","lineage":["https://openalex.org/I33256026"]},{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"J\u00f6rg Hoffmann","raw_affiliation_strings":["Saarland University\nGerman Research Center for Artificial Intelligence (DFKI)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University\nGerman Research Center for Artificial Intelligence (DFKI)","institution_ids":["https://openalex.org/I33256026","https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"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.26635549,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"35","issue":"1","first_page":"74","last_page":"83"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.854200005531311,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.854200005531311,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.7671999931335449,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.7513999938964844,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8547000288963318},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6482999920845032},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.5608000159263611},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4851999878883362},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45739999413490295},{"id":"https://openalex.org/keywords/automated-planning-and-scheduling","display_name":"Automated planning and scheduling","score":0.43810001015663147}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8547000288963318},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6482999920845032},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6269999742507935},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.5608000159263611},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4851999878883362},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45739999413490295},{"id":"https://openalex.org/C114073186","wikidata":"https://www.wikidata.org/wiki/Q2631895","display_name":"Automated planning and scheduling","level":2,"score":0.43810001015663147},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4212000072002411},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.4196000099182129},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.34880000352859497},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33480000495910645},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3246000111103058},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32280001044273376},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.322299987077713},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31220000982284546},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3070000112056732},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2985999882221222},{"id":"https://openalex.org/C2780616401","wikidata":"https://www.wikidata.org/wiki/Q1133673","display_name":"Cornerstone","level":2,"score":0.2540999948978424}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1609/icaps.v35i1.36103","is_oa":true,"landing_page_url":"https://doi.org/10.1609/icaps.v35i1.36103","pdf_url":"https://ojs.aaai.org/index.php/ICAPS/article/download/36103/38257","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:pure.atira.dk:publications/6bbb6db4-9772-407b-82b3-bc813cec8484","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/6bbb6db4-9772-407b-82b3-bc813cec8484","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"doi:10.1609/icaps.v35i1.36103","is_oa":true,"landing_page_url":"https://doi.org/10.1609/icaps.v35i1.36103","pdf_url":"https://ojs.aaai.org/index.php/ICAPS/article/download/36103/38257","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/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/W4414222848.pdf","grobid_xml":"https://content.openalex.org/works/W4414222848.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Recent":[0],"interest":[1],"in":[2,38,162],"solving":[3],"planning":[4,41,48],"tasks,":[5,61],"where":[6,62,80],"full":[7],"grounding":[8,87],"is":[9,34,65,84],"infeasible,":[10],"has":[11],"highlighted":[12],"the":[13,27,30,44,63,102,114,142,150,166],"need":[14],"to":[15,26,59,69,93,149],"compute":[16],"heuristics":[17],"at":[18],"a":[19,81,107,159],"lifted":[20,47,60,82,152],"level.":[21],"We":[22,50,77],"turn":[23],"our":[24],"attention":[25],"evaluation":[28,140],"of":[29,141],"h\u1d43\u1d48\u1d48":[31,121,154],"heuristic,":[32],"which":[33],"an":[35,138],"important":[36],"cornerstone":[37],"many":[39],"classical":[40],"approaches,":[42],"including":[43],"best":[45],"performing":[46],"approach.":[49],"show":[51],"that":[52],"h\u1d43\u1d48\u1d48\u2019s":[53],"grounded":[54],"efficiency":[55],"does":[56],"not":[57],"extend":[58],"computation":[64,83],"EXPTIME-complete.":[66],"This":[67],"prompts":[68],"identify":[70,78],"tractability":[71],"islands":[72],"matching":[73],"practical":[74],"use":[75],"cases.":[76],"two,":[79],"feasible":[85],"while":[86],"may":[88],"fail:":[89],"The":[90],"first":[91],"constraints":[92],"acyclic":[94,118],"action":[95,135],"schemata":[96],"and":[97,120,134],"bounds":[98],"predicate":[99,133],"arity.":[100],"For":[101],"second":[103],"case":[104],"we":[105,145],"introduce":[106],"novel":[108],"computation,":[109],"operating":[110],"without":[111],"grounding.":[112],"Assuming":[113],"extraction":[115],"encounters":[116],"only":[117],"conditions,":[119],"values":[122],"per":[123],"subgoal":[124],"are":[125],"bounded,":[126],"it":[127],"remains":[128],"tractable.":[129],"(Even":[130],"with":[131],"unbounded":[132],"arity.)":[136],"In":[137],"empirical":[139],"new":[143,160],"technique,":[144],"observe":[146],"complementary":[147],"behavior":[148],"existing":[151],"forward":[153],"evaluation.":[155],"Combining":[156],"both":[157],"sets":[158],"state-of-the-art":[161],"pure-heuristic":[163],"performance":[164],"on":[165],"hard-to-ground":[167],"benchmarks.":[168]},"counts_by_year":[],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2025-10-10T00:00:00"}