{"id":"https://openalex.org/W7162419828","doi":"https://doi.org/10.48550/arxiv.2605.25180","title":"DateSAT: A Framework for Solving Date and Period Constraints","display_name":"DateSAT: A Framework for Solving Date and Period Constraints","publication_year":2026,"publication_date":"2026-05-24","ids":{"openalex":"https://openalex.org/W7162419828","doi":"https://doi.org/10.48550/arxiv.2605.25180"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.25180","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.25180","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.2605.25180","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060931491","display_name":"Leyi Cui","orcid":"https://orcid.org/0009-0002-0038-3083"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cui, Leyi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101520294","display_name":"Shrey Tiwari","orcid":"https://orcid.org/0000-0001-6697-0219"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tiwari, Shrey","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5077787726","display_name":"Rohan Padhye","orcid":"https://orcid.org/0000-0003-4939-033X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Padhye, Rohan","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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.2117999941110611,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.2117999941110611,"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/T10142","display_name":"Formal Methods in Verification","score":0.0957999974489212,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.08529999852180481,"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/semantics","display_name":"Semantics (computer science)","score":0.5526999831199646},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.536300003528595},{"id":"https://openalex.org/keywords/period","display_name":"Period (music)","score":0.5034000277519226},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4562000036239624},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.44850000739097595},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4399999976158142},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.41620001196861267},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.3452000021934509}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5892999768257141},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5526999831199646},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.536300003528595},{"id":"https://openalex.org/C2781291010","wikidata":"https://www.wikidata.org/wiki/Q178580","display_name":"Period (music)","level":2,"score":0.5034000277519226},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4562000036239624},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.44850000739097595},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4399999976158142},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.41620001196861267},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.39419999718666077},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3452000021934509},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3422999978065491},{"id":"https://openalex.org/C195344581","wikidata":"https://www.wikidata.org/wiki/Q2555318","display_name":"Automated reasoning","level":2,"score":0.3149999976158142},{"id":"https://openalex.org/C108650721","wikidata":"https://www.wikidata.org/wiki/Q1783253","display_name":"Counterfactual thinking","level":2,"score":0.3089999854564667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27469998598098755},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.2709999978542328},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.26910001039505005},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.262800008058548},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.26100000739097595},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.2603999972343445},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.2535000145435333},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.2515000104904175}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.25180","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.25180","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.25180","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.25180","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Dates":[0],"and":[1,17,28,49,59,89,95,105,110,155,159],"calendar":[2,96],"periods":[3],"(i.e.,":[4],"days,":[5],"months,":[6],"years)":[7],"appear":[8],"frequently":[9],"in":[10],"tasks":[11],"involving":[12,26,76,93,130],"analysis":[13,58],"of":[14,108,145,165],"software,":[15],"data,":[16],"documents.":[18],"Prior":[19],"research":[20],"has":[21],"shown":[22],"that":[23],"computer":[24],"logic":[25],"dates":[27,94],"calendrical":[29,77],"calculations":[30],"is":[31],"error-prone":[32],"due":[33],"to":[34,72,127],"tricky":[35],"rules":[36],"(e.g.,":[37,42,52],"irregularly":[38],"sized":[39],"months),":[40],"ambiguities":[41],"scheduling":[43],"one":[44],"month":[45],"from":[46],"\"Jan":[47],"31st\"),":[48],"edge":[50],"cases":[51],"leap":[53],"years).":[54],"However,":[55],"existing":[56],"program":[57],"verification":[60],"tools":[61],"do":[62],"not":[63],"provide":[64],"native":[65],"support":[66],"for":[67,87,120],"dates,":[68],"making":[69],"it":[70],"hard":[71],"reason":[73],"about":[74],"operations":[75],"arithmetic":[78],"symbolically.":[79],"This":[80],"paper":[81,99,114],"presents":[82,116],"DateSAT,":[83],"the":[84,106],"first":[85,100],"framework":[86],"expressing":[88],"solving":[90,121],"satisfiability":[91],"constraints":[92,123,148],"periods.":[97],"The":[98,113],"formalizes":[101],"an":[102,162],"input":[103],"language":[104],"semantics":[107],"date":[109],"period":[111],"arithmetic.":[112],"then":[115,160],"five":[117],"separate":[118],"strategies":[119],"DateSAT":[122,147,166],"based":[124],"on":[125],"reductions":[126],"SMT":[128],"formulas":[129],"integers,":[131],"which":[132],"we":[133],"have":[134],"implemented":[135],"using":[136,150],"Z3":[137],"as":[138],"a":[139,143],"backend.":[140],"We":[141],"curate":[142],"dataset":[144],"450":[146],"synthesized":[149],"LLM":[151],"prompting,":[152],"grammar-based":[153],"sampling,":[154],"mining":[156],"legal":[157],"documents,":[158],"present":[161],"empirical":[163],"evaluation":[164],"solver":[167],"performance.":[168]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-27T00:00:00"}