{"id":"https://openalex.org/W7168146538","doi":"https://doi.org/10.4230/lipics.cp.2026.55","title":"An Automata-Based Constraint Programming Framework for Optimal Classical Planning","display_name":"An Automata-Based Constraint Programming Framework for Optimal Classical Planning","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7168146538","doi":"https://doi.org/10.4230/lipics.cp.2026.55"},"language":"en","primary_location":{"id":"pmh:oai:publications.polymtl.ca:80056","is_oa":false,"landing_page_url":"https://publications.polymtl.ca/80056/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Communication de conf\u00e9rence"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol379-cp2026/LIPIcs.CP.2026.55/LIPIcs.CP.2026.55.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5130226869","display_name":"Damien Van Meerbeeck","orcid":null},"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"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Van Meerbeeck, Damien","raw_affiliation_strings":["Link\u00f6ping University, Sweden"],"raw_orcid":"https://orcid.org/0009-0005-0478-4003","affiliations":[{"raw_affiliation_string":"Link\u00f6ping University, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055450721","display_name":"Arnaud Lequen","orcid":"https://orcid.org/0000-0003-0339-0967"},"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"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Lequen, Arnaud","raw_affiliation_strings":["Link\u00f6ping University, Sweden"],"raw_orcid":"https://orcid.org/0000-0003-0339-0967","affiliations":[{"raw_affiliation_string":"Link\u00f6ping University, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018000450","display_name":"Gilles Pesant","orcid":"https://orcid.org/0000-0001-9797-0780"},"institutions":[{"id":"https://openalex.org/I45683168","display_name":"Polytechnique Montr\u00e9al","ror":"https://ror.org/05f8d4e86","country_code":"CA","type":"education","lineage":["https://openalex.org/I45683168"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Pesant, Gilles","raw_affiliation_strings":["Polytechnique Montr\u00e9al, Canada"],"raw_orcid":"https://orcid.org/0000-0001-9797-0780","affiliations":[{"raw_affiliation_string":"Polytechnique Montr\u00e9al, Canada","institution_ids":["https://openalex.org/I45683168"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031089257","display_name":"Jendrik Seipp","orcid":"https://orcid.org/0000-0002-2498-8020"},"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"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Seipp, Jendrik","raw_affiliation_strings":["Link\u00f6ping University, Sweden"],"raw_orcid":"https://orcid.org/0000-0002-2498-8020","affiliations":[{"raw_affiliation_string":"Link\u00f6ping University, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":2,"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.81670684,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.8884000182151794,"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.8884000182151794,"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.04390000179409981,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.03280000016093254,"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/automaton","display_name":"Automaton","score":0.6380000114440918},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5630999803543091},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5454999804496765},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.5027999877929688},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.46219998598098755},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.4092000126838684},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.3749000132083893}],"concepts":[{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6380000114440918},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5630999803543091},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5527999997138977},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5454999804496765},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5098999738693237},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.5027999877929688},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.46219998598098755},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.4092000126838684},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37770000100135803},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.3749000132083893},{"id":"https://openalex.org/C114073186","wikidata":"https://www.wikidata.org/wiki/Q2631895","display_name":"Automated planning and scheduling","level":2,"score":0.36970001459121704},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3612000048160553},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.3529999852180481},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2994000017642975},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.28600001335144043},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.28049999475479126},{"id":"https://openalex.org/C2777909354","wikidata":"https://www.wikidata.org/wiki/Q1386523","display_name":"Production planning","level":3,"score":0.275299996137619},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.2574999928474426},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2515999972820282},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25110000371932983}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:publications.polymtl.ca:80056","is_oa":false,"landing_page_url":"https://publications.polymtl.ca/80056/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Communication de conf\u00e9rence"},{"id":"pmh:oai:drops-oai.dagstuhl.de:26688","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2026.55","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol379-cp2026/LIPIcs.CP.2026.55/LIPIcs.CP.2026.55.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"pmh:doi:10.4230/lipics.cp.2026.55","is_oa":true,"landing_page_url":"http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6877","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"doi:10.4230/lipics.cp.2026.55","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.cp.2026.55","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26688","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2026.55","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol379-cp2026/LIPIcs.CP.2026.55/LIPIcs.CP.2026.55.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.7543182373046875,"display_name":"Sustainable cities and communities"}],"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/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/F4320321040","display_name":"National Science Council","ror":"https://ror.org/02kv4zf79"},{"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"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7168146538.pdf","grobid_xml":"https://content.openalex.org/works/W7168146538.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Recent":[0],"work":[1],"has":[2],"shown":[3],"that":[4,60,78,92],"classical":[5,110],"planning":[6,90,111],"tasks":[7,99],"can":[8,62],"be":[9,49,64],"compactly":[10],"factored":[11],"into":[12],"deterministic":[13],"finite":[14],"automata":[15,37,45],"and":[16,67],"solved":[17],"optimally":[18],"with":[19,85],"constraint":[20],"programming":[21],"(CP).":[22],"In":[23,55],"this":[24,56],"setting,":[25],"finding":[26,31],"a":[27,32],"plan":[28],"reduces":[29],"to":[30,48],"word":[33],"accepted":[34],"by":[35],"all":[36,114],"through":[38],"Regular":[39],"constraints.":[40],"So":[41],"far,":[42],"however,":[43],"these":[44],"have":[46],"had":[47],"carefully":[50],"handcrafted":[51],"from":[52,88],"PDDL":[53],"tasks.":[54],"paper,":[57],"we":[58],"show":[59,77],"they":[61],"instead":[63],"generated":[65],"automatically":[66],"used":[68],"as":[69],"the":[70,79,89,101,104],"basis":[71],"of":[72,103],"CP":[73,108],"models.":[74],"We":[75],"also":[76],"resulting":[80],"framework":[81],"is":[82],"easily":[83],"extensible":[84],"additional":[86],"constraints":[87],"literature":[91],"strengthen":[93],"propagation.":[94],"Our":[95],"approach":[96],"solves":[97],"more":[98],"than":[100],"state":[102],"art":[105],"in":[106,112],"end-to-end":[107],"for":[109],"almost":[113],"domains.":[115]},"counts_by_year":[],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2026-07-14T00:00:00"}