{"id":"https://openalex.org/W4414223175","doi":"https://doi.org/10.1609/icaps.v35i1.36124","title":"SibylSatOpt: a MaxSAT-based Greedy Optimal Search for TOHTN Planning","display_name":"SibylSatOpt: a MaxSAT-based Greedy Optimal Search for TOHTN Planning","publication_year":2025,"publication_date":"2025-09-16","ids":{"openalex":"https://openalex.org/W4414223175","doi":"https://doi.org/10.1609/icaps.v35i1.36124"},"language":"en","primary_location":{"id":"doi:10.1609/icaps.v35i1.36124","is_oa":true,"landing_page_url":"https://doi.org/10.1609/icaps.v35i1.36124","pdf_url":"https://ojs.aaai.org/index.php/ICAPS/article/download/36124/38278","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/36124/38278","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086526797","display_name":"Gaspard Quenard","orcid":null},"institutions":[{"id":"https://openalex.org/I4400008911","display_name":"Institut des langues et cultures d'Europe, Am\u00e9rique, Afrique, Asie et Australie","ror":"https://ror.org/02bxdh068","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4400008911","https://openalex.org/I899635006"]},{"id":"https://openalex.org/I899635006","display_name":"Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/02rx3b187","country_code":"FR","type":"education","lineage":["https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Gaspard Quenard","raw_affiliation_strings":["Universit\u00e9 Grenoble Alpes"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Grenoble Alpes","institution_ids":["https://openalex.org/I4400008911","https://openalex.org/I899635006"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050184071","display_name":"Damien Pellier","orcid":"https://orcid.org/0000-0003-3791-8985"},"institutions":[{"id":"https://openalex.org/I899635006","display_name":"Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/02rx3b187","country_code":"FR","type":"education","lineage":["https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Damien Pellier","raw_affiliation_strings":["University of Grenoble-Alpes"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Grenoble-Alpes","institution_ids":["https://openalex.org/I899635006"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022448200","display_name":"Humbert Fiorino","orcid":"https://orcid.org/0000-0002-6612-5549"},"institutions":[{"id":"https://openalex.org/I899635006","display_name":"Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/02rx3b187","country_code":"FR","type":"education","lineage":["https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Humbert Fiorino","raw_affiliation_strings":["University of Grenoble-Alpes"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Grenoble-Alpes","institution_ids":["https://openalex.org/I899635006"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"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.27914578,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"35","issue":"1","first_page":"236","last_page":"244"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9836999773979187,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9836999773979187,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9606999754905701,"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/T11106","display_name":"Data Management and Algorithms","score":0.9469000101089478,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/greedy-algorithm","display_name":"Greedy algorithm","score":0.7340999841690063},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5999000072479248},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.5347999930381775},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5254999995231628},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46389999985694885},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.42160001397132874},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.4059999883174896},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.38499999046325684}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7340999841690063},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5999000072479248},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5802000164985657},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5752000212669373},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.5347999930381775},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5254999995231628},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46389999985694885},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.42160001397132874},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.4059999883174896},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.38499999046325684},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.3718000054359436},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.3625999987125397},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.33329999446868896},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32089999318122864},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.31839999556541443},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3073999881744385},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.28459998965263367},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2653000056743622},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2653000056743622},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.26429998874664307},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2581000030040741},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2565000057220459},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25450000166893005},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2531999945640564}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1609/icaps.v35i1.36124","is_oa":true,"landing_page_url":"https://doi.org/10.1609/icaps.v35i1.36124","pdf_url":"https://ojs.aaai.org/index.php/ICAPS/article/download/36124/38278","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"}],"best_oa_location":{"id":"doi:10.1609/icaps.v35i1.36124","is_oa":true,"landing_page_url":"https://doi.org/10.1609/icaps.v35i1.36124","pdf_url":"https://ojs.aaai.org/index.php/ICAPS/article/download/36124/38278","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/G1041279674","display_name":"MIAI @ Grenoble Alpes","funder_award_id":"ANR-19-P3IA-0003","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G2092057362","display_name":null,"funder_award_id":"19-P3IA-0003","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G3010527862","display_name":null,"funder_award_id":"ANR\u201019","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414223175.pdf","grobid_xml":"https://content.openalex.org/works/W4414223175.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0,42],"paper":[1],"introduces":[2],"SibylSatOpt,":[3],"a":[4,30,45],"novel":[5],"approach":[6],"to":[7],"finding":[8],"optimal":[9,85],"plans":[10],"for":[11],"Totally-Ordered":[12],"HTN":[13,26],"(TOHTN)":[14],"problems":[15],"by":[16,38],"leveraging":[17],"greedy":[18],"search":[19,33],"techniques":[20],"with":[21,52],"MaxSAT.":[22],"Unlike":[23],"previous":[24],"SAT-based":[25],"planners":[27,87],"that":[28,68,80],"employed":[29],"blind":[31],"breadth-first":[32],"strategy,":[34],"SibylSatOpt":[35,81],"is":[36,72],"guided":[37],"an":[39],"admissible":[40],"heuristic.":[41,58],"heuristic":[43,66],"combines":[44],"relaxed":[46],"MaxSAT":[47],"encoding":[48],"of":[49,64],"the":[50,53,62,65,69],"problem":[51,92],"Task":[54],"Decomposition":[55],"Graph":[56],"(TDG)":[57],"As":[59],"we":[60],"demonstrate,":[61],"admissibility":[63],"guarantees":[67],"found":[70],"solution":[71],"optimal.":[73],"Experimental":[74],"results":[75],"on":[76],"IPC":[77],"benchmarks":[78],"show":[79],"significantly":[82],"outperforms":[83],"existing":[84],"TOHTN":[86],"in":[88],"both":[89],"runtime":[90],"and":[91],"coverage.":[93]},"counts_by_year":[],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2025-10-10T00:00:00"}