{"id":"https://openalex.org/W7164880927","doi":"https://doi.org/10.48550/arxiv.2606.16329","title":"Exploiting Search in Symbolic Numeric Planning with Patterns","display_name":"Exploiting Search in Symbolic Numeric Planning with Patterns","publication_year":2026,"publication_date":"2026-06-15","ids":{"openalex":"https://openalex.org/W7164880927","doi":"https://doi.org/10.48550/arxiv.2606.16329"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.16329","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.16329","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.16329","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080659970","display_name":"Matteo Cardellini","orcid":"https://orcid.org/0000-0003-3788-9475"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cardellini, Matteo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5004609930","display_name":"Enrico Giunchiglia","orcid":"https://orcid.org/0000-0001-5758-2556"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Giunchiglia, Enrico","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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.5692999958992004,"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.5692999958992004,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.12710000574588776,"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/T10142","display_name":"Formal Methods in Verification","score":0.1080000028014183,"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/state","display_name":"State (computer science)","score":0.7455000281333923},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.7021999955177307},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6592000126838684},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6175000071525574},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.6033999919891357},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5713000297546387},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4383000135421753},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.3476000130176544}],"concepts":[{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.7455000281333923},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.7021999955177307},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6592000126838684},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6175000071525574},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.6033999919891357},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5713000297546387},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5644000172615051},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5210999846458435},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4383000135421753},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41339999437332153},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.3476000130176544},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33399999141693115},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.3237999975681305},{"id":"https://openalex.org/C114073186","wikidata":"https://www.wikidata.org/wiki/Q2631895","display_name":"Automated planning and scheduling","level":2,"score":0.28760001063346863},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.28299999237060547},{"id":"https://openalex.org/C96146094","wikidata":"https://www.wikidata.org/wiki/Q609057","display_name":"Unification","level":2,"score":0.28119999170303345},{"id":"https://openalex.org/C82691427","wikidata":"https://www.wikidata.org/wiki/Q4291856","display_name":"Pattern search","level":2,"score":0.27549999952316284},{"id":"https://openalex.org/C88626702","wikidata":"https://www.wikidata.org/wiki/Q1128903","display_name":"Continuation","level":2,"score":0.27459999918937683},{"id":"https://openalex.org/C2776493592","wikidata":"https://www.wikidata.org/wiki/Q5158717","display_name":"Succinctness","level":2,"score":0.2743000090122223},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.27410000562667847},{"id":"https://openalex.org/C62360110","wikidata":"https://www.wikidata.org/wiki/Q96777007","display_name":"Circumscription","level":2,"score":0.2727999985218048},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2671999931335449},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.2614000141620636},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.2583000063896179}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.16329","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.16329","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.16329","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.16329","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"score":0.6044508814811707,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,149,242],"this":[1,150],"paper,":[2,151],"we":[3,157,247],"present":[4,280],"a":[5,17,22,26,33,42,65,170,249,256,263,290],"procedure":[6,132],"for":[7,77,160,283,293],"numeric":[8,18],"planning":[9,19],"based":[10],"on":[11],"Symbolic":[12],"Pattern":[13],"Planning":[14,53],"(SPP).":[15],"Given":[16],"problem":[20],"$\u03a0$,":[21,85],"pattern":[23,72,177,193,234,277],"$\\prec$":[24,39,73,127,235],"is":[25,74,98,109,141],"sequence":[27],"of":[28,38,84,107,123,126,255],"actions":[29],"used":[30,182,195,238],"to":[31,100,111,169,180,196,231,236,262,289],"define":[32,232,248],"formula":[34,66,250],"encoding":[35,252],"the":[36,52,71,80,94,104,114,124,176,184,192,202,206,213,218,225,233,240,253,270,276,295,304],"subsequences":[37,125],"executable":[40],"from":[41,166,205,269],"starting":[43,95,271],"state":[44,82,96,116,163,207,215,222,257,272],"$S$.":[45],"Cardellini,":[46],"Giunchiglia,":[47],"and":[48,86,102,143,199,229,302],"Maratea":[49],"(2024a)":[50],"follow":[51],"as":[54,137,139],"Satisfiability":[55],"approach":[56],"by":[57,121,146],"defining,":[58],"at":[59,89,153,244],"each":[60,90,154,245,287],"step":[61,91,186],"$n":[62],"\\ge":[63],"0$,":[64],"$\u03a0^\\prec_n$":[67,140],"in":[68,79,113,183,188,239],"which":[69,209],"$(i)$":[70,156],"computed":[75,220,226],"only":[76],"$n=0$":[78],"initial":[81,214],"$I$":[83,216],"then":[87],"exploited":[88],"$n$,":[92],"$(ii)$":[93,173],"$S$":[97,208,273],"set":[99,105],"$I$,":[101,167],"$(iii)$":[103,190],"$G$":[106],"goals":[108],"required":[110],"hold":[112],"last":[115,219],"that":[117],"can":[118,210],"be":[119,181,211,237],"reached":[120],"one":[122],"concatenated":[128],"$n$":[129],"times.":[130],"The":[131],"begins":[133],"with":[134,266],"$n=0$,":[135],"terminates":[136],"soon":[138],"satisfiable,":[142],"otherwise":[144],"proceeds":[145],"incrementing":[147],"$n$.":[148],"possibly":[152],"step,":[155,246],"symbolically":[158],"search":[159,204,296],"an":[161],"intermediate":[162,221],"$P$":[164,261],"reachable":[165,268],"closer":[168,259],"goal":[171,264],"state,":[172,265],"dynamically":[174],"recompute":[175],"$\\prec_h$":[178,230],"--":[179,187],"next":[185],"$P$,":[189,198,223],"refine":[191],"$\\prec_g$":[194,228],"reach":[197],"$(iv)$":[200],"start":[201],"new":[203],"either":[212],"or":[217],"exploiting":[224],"patterns":[227],"search.":[241],"particular,":[243],"$\u03a0^{\\prec}_{S,P}$":[251],"existence":[254],"$P'$":[258,267],"than":[260],"when":[274],"using":[275],"$\\prec$.":[278],"We":[279,298],"different":[281,291],"techniques":[282],"producing":[284],"such":[285],"formulas,":[286],"corresponding":[288],"strategy":[292],"exploring":[294],"space.":[297],"prove":[299],"their":[300],"correctness":[301],"completeness,":[303],"latter":[305],"under":[306],"certain":[307],"conditions.":[308]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-17T00:00:00"}