{"id":"https://openalex.org/W2621218814","doi":"https://doi.org/10.1017/s1471068417000175","title":"Constraint solving for finite model finding in SMT solvers","display_name":"Constraint solving for finite model finding in SMT solvers","publication_year":2017,"publication_date":"2017-06-28","ids":{"openalex":"https://openalex.org/W2621218814","doi":"https://doi.org/10.1017/s1471068417000175","mag":"2621218814"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068417000175","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068417000175","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/8637083EB0617325527CE575B94F1630/S1471068417000175a.pdf/div-class-title-constraint-solving-for-finite-model-finding-in-smt-solvers-a-href-fn01-ref-type-fn-a-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/8637083EB0617325527CE575B94F1630/S1471068417000175a.pdf/div-class-title-constraint-solving-for-finite-model-finding-in-smt-solvers-a-href-fn01-ref-type-fn-a-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083954589","display_name":"Andrew Reynolds","orcid":"https://orcid.org/0000-0002-3529-8682"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"ANDREW REYNOLDS","raw_affiliation_strings":["Department of Computer Science, The University of Iowa, Iowa City, Iowa, USA (e-mail:","the University of Iowa"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Iowa, Iowa City, Iowa, USA (e-mail:","institution_ids":["https://openalex.org/I126307644"]},{"raw_affiliation_string":"the University of Iowa","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046830049","display_name":"Cesare Tinelli","orcid":"https://orcid.org/0000-0002-6726-775X"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"CESARE TINELLI","raw_affiliation_strings":["Department of Computer Science, The University of Iowa, Iowa City, Iowa, USA (e-mail:","the University of Iowa"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Iowa, Iowa City, Iowa, USA (e-mail:","institution_ids":["https://openalex.org/I126307644"]},{"raw_affiliation_string":"the University of Iowa","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026961968","display_name":"Clark Barrett","orcid":"https://orcid.org/0000-0002-9522-3084"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"CLARK BARRETT","raw_affiliation_strings":["Department of Computer Science, Stanford University, Stanford, California, USA (e-mail:","Stanford University ()"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford, California, USA (e-mail:","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Stanford University ()","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083954589"],"corresponding_institution_ids":["https://openalex.org/I126307644"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07759517,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"4","first_page":"516","last_page":"558"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9979000091552734,"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"}},"topics":[{"id":"https://openalex.org/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9979000091552734,"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"}},{"id":"https://openalex.org/T10215","display_name":"Semantic Web and Ontologies","score":0.9970999956130981,"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/T10126","display_name":"Logic, programming, and type systems","score":0.992900013923645,"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/computer-science","display_name":"Computer science","score":0.7375674247741699},{"id":"https://openalex.org/keywords/automated-reasoning","display_name":"Automated reasoning","score":0.6635139584541321},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6433807015419006},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.5836036205291748},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5219578146934509},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5195212960243225},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.46536898612976074},{"id":"https://openalex.org/keywords/forcing","display_name":"Forcing (mathematics)","score":0.4652346968650818},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.44386476278305054},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3993949890136719},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3542026877403259},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1871357262134552},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.108294278383255}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7375674247741699},{"id":"https://openalex.org/C195344581","wikidata":"https://www.wikidata.org/wiki/Q2555318","display_name":"Automated reasoning","level":2,"score":0.6635139584541321},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6433807015419006},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.5836036205291748},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5219578146934509},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5195212960243225},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.46536898612976074},{"id":"https://openalex.org/C197115733","wikidata":"https://www.wikidata.org/wiki/Q1003136","display_name":"Forcing (mathematics)","level":2,"score":0.4652346968650818},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.44386476278305054},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3993949890136719},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3542026877403259},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1871357262134552},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.108294278383255},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s1471068417000175","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068417000175","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/8637083EB0617325527CE575B94F1630/S1471068417000175a.pdf/div-class-title-constraint-solving-for-finite-model-finding-in-smt-solvers-a-href-fn01-ref-type-fn-a-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1706.00096","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1706.00096","pdf_url":"https://arxiv.org/pdf/1706.00096","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":"","raw_type":"text"},{"id":"mag:2621218814","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1706.00096.pdf","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1706.00096","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1706.00096","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1017/s1471068417000175","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068417000175","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/8637083EB0617325527CE575B94F1630/S1471068417000175a.pdf/div-class-title-constraint-solving-for-finite-model-finding-in-smt-solvers-a-href-fn01-ref-type-fn-a-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320307102","display_name":"Intel Corporation","ror":"https://ror.org/01ek73717"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2621218814.pdf","grobid_xml":"https://content.openalex.org/works/W2621218814.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W1781094","https://openalex.org/W26338302","https://openalex.org/W47092936","https://openalex.org/W148663991","https://openalex.org/W1489937864","https://openalex.org/W1519503479","https://openalex.org/W1559664284","https://openalex.org/W1573992413","https://openalex.org/W1807554065","https://openalex.org/W1967030498","https://openalex.org/W2009715851","https://openalex.org/W2022846948","https://openalex.org/W2032950184","https://openalex.org/W2055477538","https://openalex.org/W2058903513","https://openalex.org/W2098095758","https://openalex.org/W2159786179","https://openalex.org/W2162131937","https://openalex.org/W2470240105","https://openalex.org/W4230919050","https://openalex.org/W4241540767","https://openalex.org/W4246691913","https://openalex.org/W4253178675","https://openalex.org/W6637837010","https://openalex.org/W6686004993"],"related_works":["https://openalex.org/W2963499262","https://openalex.org/W148663991","https://openalex.org/W2888632077","https://openalex.org/W3196865231","https://openalex.org/W3163732942","https://openalex.org/W3189272223","https://openalex.org/W2951613327","https://openalex.org/W3004482543","https://openalex.org/W2395386862","https://openalex.org/W1486180542","https://openalex.org/W3029559354","https://openalex.org/W2365431995","https://openalex.org/W2952723349","https://openalex.org/W153407638","https://openalex.org/W2950942492","https://openalex.org/W169672073","https://openalex.org/W2951617067","https://openalex.org/W1856554806","https://openalex.org/W2029843512","https://openalex.org/W3137139687"],"abstract_inverted_index":{"Abstract":[0],"Satisfiability":[1],"modulo":[2],"theories":[3],"(SMT)":[4],"solvers":[5,37],"have":[6],"been":[7],"used":[8,90],"successfully":[9],"as":[10,107,109],"reasoning":[11],"engines":[12],"for":[13,25,104,111],"automated":[14,21,137],"verification":[15],"and":[16,132],"other":[17],"applications":[18,63],"based":[19,83],"on":[20,84],"reasoning.":[22],"Current":[23],"techniques":[24,82,110],"dealing":[26],"with":[27,51,124],"quantified":[28,68,115],"formulas":[29],"in":[30,62,130,136],"SMT":[31,36,93],"are":[32],"generally":[33],"incomplete,":[34],"forcing":[35],"to":[38,44,55,134],"report":[39],"\u201cunknown\u201d":[40],"when":[41],"they":[42],"fail":[43],"prove":[45],"the":[46,88,125,128],"unsatisfiability":[47],"of":[48,114,127],"a":[49,101],"formula":[50],"quantifiers.":[52],"This":[53,95],"inability":[54],"return":[56],"counter":[57],"models":[58],"limits":[59],"their":[60],"usefulness":[61],"that":[64,119],"produce":[65],"queries":[66],"involving":[67],"formulas.":[69,116],"In":[70],"this":[71],"paper,":[72],"we":[73],"reduce":[74],"these":[75],"limitations":[76],"by":[77,91,100],"integrating":[78],"finite":[79],"model":[80],"finding":[81],"constraint":[85],"solving":[86],"into":[87],"architecture":[89],"modern":[92],"solvers.":[94],"approach":[96,121],"is":[97,122],"made":[98],"possible":[99],"novel":[102],"solver":[103],"cardinality":[105],"constraints,":[106],"well":[108],"on-demand":[112],"instantiation":[113],"Experiments":[117],"show":[118],"our":[120],"competitive":[123],"state":[126],"art":[129],"SMT,":[131],"orthogonal":[133],"approaches":[135],"theorem":[138],"proving.":[139]},"counts_by_year":[],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}