{"id":"https://openalex.org/W2022846948","doi":"https://doi.org/10.1145/1217856.1217859","title":"Solving SAT and SAT Modulo Theories","display_name":"Solving SAT and SAT Modulo Theories","publication_year":2006,"publication_date":"2006-11-01","ids":{"openalex":"https://openalex.org/W2022846948","doi":"https://doi.org/10.1145/1217856.1217859","mag":"2022846948"},"language":"en","primary_location":{"id":"doi:10.1145/1217856.1217859","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1217856.1217859","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033002201","display_name":"Robert Nieuwenhuis","orcid":"https://orcid.org/0000-0002-6489-2138"},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"Robert Nieuwenhuis","raw_affiliation_strings":["Technical University of Catalonia, Barcelona, Spain"],"affiliations":[{"raw_affiliation_string":"Technical University of Catalonia, Barcelona, Spain","institution_ids":["https://openalex.org/I9617848"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087949614","display_name":"Albert Oliveras","orcid":"https://orcid.org/0000-0002-5893-1911"},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Albert Oliveras","raw_affiliation_strings":["Technical University of Catalonia, Barcelona, Spain"],"affiliations":[{"raw_affiliation_string":"Technical University of Catalonia, Barcelona, Spain","institution_ids":["https://openalex.org/I9617848"]}]},{"author_position":"last","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":["The University of Iowa, Iowa City, Iowa","The University of Iowa , Iowa City, Iowa"],"affiliations":[{"raw_affiliation_string":"The University of Iowa, Iowa City, Iowa","institution_ids":["https://openalex.org/I126307644"]},{"raw_affiliation_string":"The University of Iowa , Iowa City, Iowa","institution_ids":["https://openalex.org/I126307644"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5033002201"],"corresponding_institution_ids":["https://openalex.org/I9617848"],"apc_list":null,"apc_paid":null,"fwci":33.7058,"has_fulltext":false,"cited_by_count":773,"citation_normalized_percentile":{"value":0.99880642,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"53","issue":"6","first_page":"937","last_page":"977"},"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.9983000159263611,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dpll-algorithm","display_name":"DPLL algorithm","score":0.9927310943603516},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.7203371524810791},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.6865642070770264},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6555285453796387},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.579171895980835},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.558594822883606},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5065673589706421},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5015156269073486},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5006814002990723},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.46316584944725037},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41265612840652466},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29999783635139465},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.24820804595947266},{"id":"https://openalex.org/keywords/phase-locked-loop","display_name":"Phase-locked loop","score":0.14651796221733093}],"concepts":[{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.9927310943603516},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.7203371524810791},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.6865642070770264},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6555285453796387},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.579171895980835},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.558594822883606},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5065673589706421},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5015156269073486},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5006814002990723},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.46316584944725037},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41265612840652466},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29999783635139465},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.24820804595947266},{"id":"https://openalex.org/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.14651796221733093},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"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/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1217856.1217859","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1217856.1217859","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":54,"referenced_works":["https://openalex.org/W26772505","https://openalex.org/W323309086","https://openalex.org/W1483783534","https://openalex.org/W1484352250","https://openalex.org/W1489527380","https://openalex.org/W1491144250","https://openalex.org/W1498734916","https://openalex.org/W1498747704","https://openalex.org/W1500991862","https://openalex.org/W1511155470","https://openalex.org/W1512564652","https://openalex.org/W1515175581","https://openalex.org/W1515278398","https://openalex.org/W1518705996","https://openalex.org/W1532000439","https://openalex.org/W1534716074","https://openalex.org/W1535839566","https://openalex.org/W1568333198","https://openalex.org/W1572729891","https://openalex.org/W1582571943","https://openalex.org/W1589982562","https://openalex.org/W1592502301","https://openalex.org/W1599214850","https://openalex.org/W1741528175","https://openalex.org/W1838348862","https://openalex.org/W1929502661","https://openalex.org/W1948299783","https://openalex.org/W1963547452","https://openalex.org/W2000346568","https://openalex.org/W2033937366","https://openalex.org/W2044560939","https://openalex.org/W2047237020","https://openalex.org/W2057361103","https://openalex.org/W2062897452","https://openalex.org/W2063727779","https://openalex.org/W2075959177","https://openalex.org/W2096307462","https://openalex.org/W2097414162","https://openalex.org/W2100126165","https://openalex.org/W2104115705","https://openalex.org/W2108637261","https://openalex.org/W2109939657","https://openalex.org/W2113732070","https://openalex.org/W2118154221","https://openalex.org/W2137182326","https://openalex.org/W2142785340","https://openalex.org/W2159503942","https://openalex.org/W2165775376","https://openalex.org/W2259817465","https://openalex.org/W2621468397","https://openalex.org/W2911583164","https://openalex.org/W2913314261","https://openalex.org/W4236504040","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W2048447692","https://openalex.org/W2394349251","https://openalex.org/W2480084299","https://openalex.org/W4302330337","https://openalex.org/W2014111643","https://openalex.org/W2089119454","https://openalex.org/W3107131366","https://openalex.org/W2433853642","https://openalex.org/W2091617677","https://openalex.org/W1572868659"],"abstract_inverted_index":{"We":[0,138],"first":[1],"introduce":[2,92],"Abstract":[3],"DPLL":[4,26,52],",":[5,130,153,160],"a":[6,35,93,97,107,120,126,133],"rule-based":[7],"formulation":[8],"of":[9,79,96,143,157,199],"the":[10,50,64,80,140,155,191],"Davis--Putnam--Logemann--Loveland":[11],"(DPLL)":[12],"procedure":[13],"for":[14,84,103,125,168],"propositional":[15],"satisfiability.":[16],"This":[17],"abstract":[18],"framework":[19,65],"allows":[20],"one":[21],"to":[22,29,49,66,75,91],"cleanly":[23],"express":[24],"practical":[25],"algorithms":[27],"and":[28,72,100,147,161,201],"formally":[30],"reason":[31],"about":[32],"them":[33],"in":[34,172,179,197],"simple":[36],"way.":[37],"Its":[38],"properties,":[39],"such":[40,56],"as":[41,57],"soundness,":[42],"completeness":[43],"or":[44,59],"termination,":[45],"immediately":[46],"carry":[47],"over":[48],"modern":[51],"implementations":[53],"with":[54,119,150],"features":[55],"backjumping":[58],"clause":[60],"learning.We":[61],"then":[62],"extend":[63],"Satisfiability":[67],"Modulo":[68],"background":[69],"Theories":[70],"(SMT)":[71],"use":[73,89],"it":[74,90],"model":[76],"several":[77],"variants":[78,95],"so-called":[81],"lazy":[82],"approach":[83,102],"SMT.":[85],"In":[86],"particular,":[87],"we":[88],"few":[94],"new,":[98],"efficient":[99],"modular":[101],"SMT":[104],"based":[105],"on":[106],"general":[108],"DPLL(":[109,134,144,164,184],"X":[110,115,145],")":[111,136,146,166,186],"engine,":[112],"whose":[113],"parameter":[114],"can":[116,188],"be":[117],"instantiated":[118],"specialized":[121],"solver":[122],"Solver":[123,151],"T":[124,129,135,152,165,185],"given":[127],"theory":[128,158],"thus":[131],"producing":[132],"system.":[137],"describe":[139,162],"high-level":[141],"design":[142],"its":[148],"cooperation":[149],"discuss":[154],"role":[156],"propagation":[159],"different":[163],"strategies":[167],"some":[169],"theories":[170],"arising":[171],"industrial":[173],"applications.Our":[174],"extensive":[175],"experimental":[176],"evidence,":[177],"summarized":[178],"this":[180],"article,":[181],"shows":[182],"that":[183],"systems":[187],"significantly":[189],"outperform":[190],"other":[192],"state-of-the-art":[193],"tools,":[194],"frequently":[195],"even":[196],"orders":[198],"magnitude,":[200],"have":[202],"better":[203],"scaling":[204],"properties.":[205]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":15},{"year":2024,"cited_by_count":17},{"year":2023,"cited_by_count":26},{"year":2022,"cited_by_count":26},{"year":2021,"cited_by_count":39},{"year":2020,"cited_by_count":37},{"year":2019,"cited_by_count":40},{"year":2018,"cited_by_count":47},{"year":2017,"cited_by_count":39},{"year":2016,"cited_by_count":47},{"year":2015,"cited_by_count":52},{"year":2014,"cited_by_count":56},{"year":2013,"cited_by_count":68},{"year":2012,"cited_by_count":63}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}