{"id":"https://openalex.org/W2796695740","doi":"https://doi.org/10.23638/lmcs-14(4:12)2018","title":"Reasoning with Finite Sets and Cardinality Constraints in SMT","display_name":"Reasoning with Finite Sets and Cardinality Constraints in SMT","publication_year":2018,"publication_date":"2018-11-01","ids":{"openalex":"https://openalex.org/W2796695740","doi":"https://doi.org/10.23638/lmcs-14(4:12)2018","mag":"2796695740"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-14(4:12)2018","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-14(4:12)2018","pdf_url":"https://lmcs.episciences.org/4950/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","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/4950/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032173124","display_name":"Kshitij Bansal","orcid":"https://orcid.org/0009-0000-8992-4071"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kshitij Bansal","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026961968","display_name":"Clark Barrett","orcid":"https://orcid.org/0000-0002-9522-3084"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Clark Barrett","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-9522-3084","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083954589","display_name":"Andrew Reynolds","orcid":"https://orcid.org/0000-0002-3529-8682"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andrew Reynolds","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5046830049","display_name":"Cesare Tinelli","orcid":"https://orcid.org/0000-0002-6726-775X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cesare Tinelli","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-6726-775X","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1893,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.52030005,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"Volume 14, Issue 4","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.9998000264167786,"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.9998000264167786,"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.9997000098228455,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9994000196456909,"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/cardinality","display_name":"Cardinality (data modeling)","score":0.6680530309677124},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6438757181167603},{"id":"https://openalex.org/keywords/venn-diagram","display_name":"Venn diagram","score":0.6167038679122925},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5833445191383362},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.520541787147522},{"id":"https://openalex.org/keywords/dpll-algorithm","display_name":"DPLL algorithm","score":0.49901843070983887},{"id":"https://openalex.org/keywords/automated-reasoning","display_name":"Automated reasoning","score":0.49663835763931274},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.45066842436790466},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.44583016633987427},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.44282519817352295},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.4332270622253418},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.42664772272109985},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.4218409061431885},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3546995520591736},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2943205237388611},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.29073068499565125},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.1798248589038849},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.11287292838096619}],"concepts":[{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6680530309677124},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6438757181167603},{"id":"https://openalex.org/C55508974","wikidata":"https://www.wikidata.org/wiki/Q190763","display_name":"Venn diagram","level":2,"score":0.6167038679122925},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5833445191383362},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.520541787147522},{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.49901843070983887},{"id":"https://openalex.org/C195344581","wikidata":"https://www.wikidata.org/wiki/Q2555318","display_name":"Automated reasoning","level":2,"score":0.49663835763931274},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.45066842436790466},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.44583016633987427},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.44282519817352295},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.4332270622253418},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.42664772272109985},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.4218409061431885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3546995520591736},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2943205237388611},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.29073068499565125},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.1798248589038849},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.11287292838096619},{"id":"https://openalex.org/C145420912","wikidata":"https://www.wikidata.org/wiki/Q853077","display_name":"Mathematics education","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0},{"id":"https://openalex.org/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.23638/lmcs-14(4:12)2018","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-14(4:12)2018","pdf_url":"https://lmcs.episciences.org/4950/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:1702.06259","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1702.06259","pdf_url":"https://arxiv.org/pdf/1702.06259","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":"doi:10.48550/arxiv.1702.06259","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1702.06259","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:2963483933","is_oa":true,"landing_page_url":"https://dblp.uni-trier.de/db/journals/lmcs/lmcs14.html#BansalBRT18","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":"Logical Methods in Computer Science","raw_type":null}],"best_oa_location":{"id":"doi:10.23638/lmcs-14(4:12)2018","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-14(4:12)2018","pdf_url":"https://lmcs.episciences.org/4950/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/G3058299377","display_name":"SHF: Small: Integrating separation logic and SMT for better heap verification","funder_award_id":"1320583","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8649265976","display_name":"TWC: Medium: Collaborative: Breaking the Satisfiability Modulo Theories (SMT) Bottleneck in Symbolic Security Analysis","funder_award_id":"1228768","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320319918","display_name":"York University","ror":"https://ror.org/05fq50484"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2796695740.pdf","grobid_xml":"https://content.openalex.org/works/W2796695740.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1416602162","https://openalex.org/W1553603549","https://openalex.org/W1556480840","https://openalex.org/W1559870885","https://openalex.org/W1583295953","https://openalex.org/W1585022015","https://openalex.org/W1592963626","https://openalex.org/W1895387792","https://openalex.org/W2017184931","https://openalex.org/W2022846948","https://openalex.org/W2102913701","https://openalex.org/W2125954792","https://openalex.org/W2133570754","https://openalex.org/W2497399989","https://openalex.org/W2520086438","https://openalex.org/W2734634746"],"related_works":["https://openalex.org/W1868334863","https://openalex.org/W2159786179","https://openalex.org/W2585406248","https://openalex.org/W1595962583","https://openalex.org/W2287565210","https://openalex.org/W2460803124","https://openalex.org/W2188204860","https://openalex.org/W2396384868","https://openalex.org/W2022846948","https://openalex.org/W1023414264"],"abstract_inverted_index":{"We":[0,62],"consider":[1],"the":[2,6,12,57,127,130,147,155],"problem":[3],"of":[4,8,14,48,59,70,171],"deciding":[5],"satisfiability":[7],"quantifier-free":[9],"formulas":[10],"in":[11,28,104],"theory":[13,33],"finite":[15],"sets":[16,43,92],"with":[17,78,160],"cardinality":[18,84],"constraints.":[19,85],"Sets":[20],"are":[21,44,117,158],"a":[22,32,45,64,67,71,79,110,123],"common":[23],"high-level":[24],"data":[25],"structure":[26],"used":[27],"programming;":[29],"thus,":[30],"such":[31],"is":[34],"useful":[35],"for":[36,73,81],"modeling":[37],"program":[38],"constructs":[39],"directly.":[40],"More":[41],"importantly,":[42],"basic":[46],"construct":[47],"mathematics":[49],"and":[50,163],"thus":[51],"natural":[52],"to":[53,125,138],"use":[54],"when":[55],"formalizing":[56],"properties":[58],"computational":[60],"systems.":[61],"develop":[63,109],"calculus":[65,134],"describing":[66],"modular":[68],"combination":[69],"procedure":[72,80],"reasoning":[74,82,87],"about":[75,83],"membership":[76],"constraints":[77],"Cardinality":[86],"involves":[88],"tracking":[89],"how":[90],"different":[91,131],"overlap.":[93],"For":[94],"efficiency,":[95],"we":[96,108],"avoid":[97],"considering":[98],"Venn":[99],"regions":[100,116],"directly,":[101],"as":[102,120],"done":[103],"previous":[105,161],"work.":[106],"Instead,":[107],"novel":[111],"technique":[112],"wherein":[113],"potentially":[114],"overlapping":[115],"considered":[118],"incrementally":[119],"needed,":[121],"using":[122],"graph":[124],"track":[126],"interaction":[128],"among":[129],"regions.":[132],"The":[133],"has":[135],"been":[136],"designed":[137],"facilitate":[139],"its":[140],"implementation":[141],"within":[142],"SMT":[143],"solvers":[144],"based":[145],"on":[146,168],"DPLL($T$)":[148],"architecture.":[149],"Our":[150],"experimental":[151],"results":[152],"demonstrate":[153],"that":[154],"new":[156],"techniques":[157,162],"competitive":[159],"can":[164],"scale":[165],"much":[166],"better":[167],"certain":[169],"classes":[170],"problems.":[172]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}