{"id":"https://openalex.org/W2952158563","doi":"https://doi.org/10.2168/lmcs-1(2:6)2005","title":"Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds","display_name":"Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds","publication_year":2005,"publication_date":"2005-12-19","ids":{"openalex":"https://openalex.org/W2952158563","doi":"https://doi.org/10.2168/lmcs-1(2:6)2005","mag":"2952158563"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-1(2:6)2005","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-1(2:6)2005","pdf_url":"https://lmcs.episciences.org/2270/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/2270/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Sanjit A. Seshia","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanjit A. Seshia","raw_affiliation_strings":["Department of Electrical Engineering and Computer Sciences, University of California at Berkeley, 253 Cory Hall #1770, Berkeley, CA 94720, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Sciences, University of California at Berkeley, 253 Cory Hall #1770, Berkeley, CA 94720, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":null,"display_name":"Randal E. Bryant","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Randal E. Bryant","raw_affiliation_strings":["School of Computer Science, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6747,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.74932718,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 1, Issue 2","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9133999943733215,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9133999943733215,"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/T10126","display_name":"Logic, programming, and type systems","score":0.036400001496076584,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.01730000041425228,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/presburger-arithmetic","display_name":"Presburger arithmetic","score":0.9077000021934509},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7021999955177307},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5633000135421753},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.5629000067710876},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5292999744415283},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5103999972343445},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5047000050544739},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5008999705314636},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4869999885559082},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.43149998784065247}],"concepts":[{"id":"https://openalex.org/C5852641","wikidata":"https://www.wikidata.org/wiki/Q956059","display_name":"Presburger arithmetic","level":3,"score":0.9077000021934509},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7021999955177307},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6330999732017517},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5633000135421753},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.5629000067710876},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5292999744415283},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5271999835968018},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5103999972343445},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5047000050544739},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5008999705314636},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4869999885559082},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.43149998784065247},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.4277999997138977},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41179999709129333},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.38940000534057617},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.3621000051498413},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.35499998927116394},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.3465000092983246},{"id":"https://openalex.org/C4926405","wikidata":"https://www.wikidata.org/wiki/Q3269980","display_name":"Boolean domain","level":5,"score":0.3427000045776367},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3228999972343445},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.31949999928474426},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.30300000309944153},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3012000024318695},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.29330000281333923},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.2919999957084656},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.289000004529953},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.2791999876499176},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.2784000039100647},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2770000100135803},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.2669000029563904},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.2606000006198883},{"id":"https://openalex.org/C84135550","wikidata":"https://www.wikidata.org/wiki/Q3154022","display_name":"Linear inequality","level":3,"score":0.25769999623298645}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2168/lmcs-1(2:6)2005","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-1(2:6)2005","pdf_url":"https://lmcs.episciences.org/2270/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:cs/0508044","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0508044","pdf_url":"https://arxiv.org/pdf/cs/0508044","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:a014bd6a9d6c48aa9046827ac79f702a","is_oa":true,"landing_page_url":"https://doaj.org/article/a014bd6a9d6c48aa9046827ac79f702a","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 1, Issue 2 (2005)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-1(2:6)2005","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-1(2:6)2005","pdf_url":"https://lmcs.episciences.org/2270/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5389952002","display_name":null,"funder_award_id":"DAAD19-01-1-0485","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"}],"funders":[{"id":"https://openalex.org/F4320320875","display_name":"Deutscher Akademischer Austauschdienst","ror":"https://ror.org/039djdh30"},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2952158563.pdf","grobid_xml":"https://content.openalex.org/works/W2952158563.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W105444088","https://openalex.org/W1498734916","https://openalex.org/W1500263346","https://openalex.org/W1522857917","https://openalex.org/W1532000439","https://openalex.org/W1568333198","https://openalex.org/W1572729891","https://openalex.org/W1592502301","https://openalex.org/W1713126207","https://openalex.org/W1747583082","https://openalex.org/W1834186039","https://openalex.org/W2029173124","https://openalex.org/W2030670832","https://openalex.org/W2052763589","https://openalex.org/W2055477538","https://openalex.org/W2056219099","https://openalex.org/W2087144842","https://openalex.org/W2097699872","https://openalex.org/W2103658959","https://openalex.org/W2113732070","https://openalex.org/W2136584020","https://openalex.org/W2142785340","https://openalex.org/W4231252310","https://openalex.org/W4236793729","https://openalex.org/W4239426483","https://openalex.org/W4242691767","https://openalex.org/W4243167850","https://openalex.org/W4247585869","https://openalex.org/W4252150051","https://openalex.org/W4254731105"],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,10,35,70,152,161,181],"formula":[2,96,170],"in":[3,19,24,42,65,74,90,113,121,129,142,151,200],"quantifier-free":[4,39,168],"Presburger":[5,40,169],"arithmetic,":[6],"if":[7],"it":[8],"has":[9,59],"satisfying":[11],"solution,":[12],"there":[13],"is":[14,21,111,132,177],"one":[15],"whose":[16],"size,":[17],"measured":[18],"bits,":[20],"polynomially":[22],"bounded":[23],"the":[25,28,52,79,85,103,114,122,136,143,166],"size":[26,125],"of":[27,38,76,81,87,95,105,116,126,135,139],"formula.":[29,144],"In":[30,98,185],"this":[31],"paper,":[32],"we":[33,100,192],"consider":[34],"special":[36],"class":[37,58],"formulas":[41],"which":[43,176],"most":[44],"linear":[45,82,112,140],"constraints":[46,54,83,118,141],"are":[47,55],"difference":[48],"(separation)":[49],"constraints,":[50,89],"and":[51,84,119,124,164],"non-difference":[53,88,117],"sparse.":[56],"This":[57],"been":[60],"observed":[61],"to":[62,92,171,187],"commonly":[63],"occur":[64],"software":[66],"verification.":[67],"We":[68],"derive":[69],"new":[71],"solution":[72],"bound":[73,147],"terms":[75],"parameters":[77],"characterizing":[78],"sparseness":[80],"number":[86,104,115,123,138],"addition":[91,186],"traditional":[93],"measures":[94],"size.":[97],"particular,":[99],"show":[101],"that":[102,205],"bits":[106],"needed":[107],"per":[108],"integer":[109,158],"variable":[110],"logarithmic":[120],"non-zero":[127],"coefficients":[128],"them,":[130],"but":[131],"otherwise":[133],"independent":[134],"total":[137],"The":[145],"derived":[146],"can":[148,209],"be":[149],"used":[150],"decision":[153,207,213],"procedure":[154,208],"based":[155],"on":[156],"instantiating":[157],"variables":[159],"over":[160],"finite":[162],"domain":[163],"translating":[165],"input":[167],"an":[172],"equi-satisfiable":[173],"Boolean":[174,182],"formula,":[175],"then":[178],"checked":[179],"using":[180],"satisfiability":[183],"solver.":[184],"our":[188,206],"main":[189],"theoretical":[190],"result,":[191],"discuss":[193],"several":[194],"optimizations":[195],"for":[196],"deriving":[197],"tighter":[198],"bounds":[199],"practice.":[201],"Empirical":[202],"evidence":[203],"indicates":[204],"greatly":[210],"outperform":[211],"other":[212],"procedures.":[214]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2019-06-27T00:00:00"}