{"id":"https://openalex.org/W2061097805","doi":"https://doi.org/10.1145/1629911.1630057","title":"Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts","display_name":"Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts","publication_year":2009,"publication_date":"2009-07-26","ids":{"openalex":"https://openalex.org/W2061097805","doi":"https://doi.org/10.1145/1629911.1630057","mag":"2061097805"},"language":"en","primary_location":{"id":"doi:10.1145/1629911.1630057","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1629911.1630057","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 46th Annual Design Automation Conference","raw_type":"proceedings-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/A5105352990","display_name":"Himanshu Jain","orcid":"https://orcid.org/0000-0003-4324-8666"},"institutions":[{"id":"https://openalex.org/I1335490905","display_name":"Synopsys (Switzerland)","ror":"https://ror.org/03mb54f81","country_code":"CH","type":"company","lineage":["https://openalex.org/I1335490905","https://openalex.org/I4210088951"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Himanshu Jain","raw_affiliation_strings":["Synopsys, Inc","Verification Group, Synopsys, Inc., USA"],"affiliations":[{"raw_affiliation_string":"Synopsys, Inc","institution_ids":["https://openalex.org/I1335490905"]},{"raw_affiliation_string":"Verification Group, Synopsys, Inc., USA","institution_ids":["https://openalex.org/I1335490905"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5105356861","display_name":"Edmund M. Clarke","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":"Edmund M. Clarke","raw_affiliation_strings":["Carnegie Mellon University","School of Computer Science, Carnegie Mellon University, USA,"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"School of Computer Science, Carnegie Mellon University, USA,","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5105352990"],"corresponding_institution_ids":["https://openalex.org/I1335490905"],"apc_list":null,"apc_paid":null,"fwci":3.085,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.91437309,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"563","last_page":"568"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"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":1.0,"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/T10743","display_name":"Software Testing and Debugging 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/T10126","display_name":"Logic, programming, and type systems","score":0.9958000183105469,"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/dpll-algorithm","display_name":"DPLL algorithm","score":0.9673745632171631},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.7577147483825684},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.7555269002914429},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6093225479125977},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5789073705673218},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.571621835231781},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47012507915496826},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.4612163305282593},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4545052647590637},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.45418205857276917},{"id":"https://openalex.org/keywords/literal","display_name":"Literal (mathematical logic)","score":0.454125314950943},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4425230920314789},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4296819865703583},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2239861786365509},{"id":"https://openalex.org/keywords/phase-locked-loop","display_name":"Phase-locked loop","score":0.0839267373085022}],"concepts":[{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.9673745632171631},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.7577147483825684},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.7555269002914429},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6093225479125977},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5789073705673218},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.571621835231781},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47012507915496826},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4612163305282593},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4545052647590637},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.45418205857276917},{"id":"https://openalex.org/C2780882242","wikidata":"https://www.wikidata.org/wiki/Q14235582","display_name":"Literal (mathematical logic)","level":2,"score":0.454125314950943},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4425230920314789},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4296819865703583},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2239861786365509},{"id":"https://openalex.org/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0839267373085022},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1629911.1630057","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1629911.1630057","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 46th Annual Design Automation Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1513176853","https://openalex.org/W1518705996","https://openalex.org/W1608123432","https://openalex.org/W1839246176","https://openalex.org/W1950282396","https://openalex.org/W2048051309","https://openalex.org/W2075959177","https://openalex.org/W2084797476","https://openalex.org/W2118613560","https://openalex.org/W2126662120","https://openalex.org/W2129369779","https://openalex.org/W2130178878","https://openalex.org/W2133527541","https://openalex.org/W2142785340","https://openalex.org/W2146662253","https://openalex.org/W4299731435","https://openalex.org/W6669778933","https://openalex.org/W6814269298"],"related_works":["https://openalex.org/W2611506716","https://openalex.org/W1916519491","https://openalex.org/W1496518193","https://openalex.org/W2610304232","https://openalex.org/W2963321374","https://openalex.org/W4301514548","https://openalex.org/W2154474334","https://openalex.org/W2061097805","https://openalex.org/W2080871662","https://openalex.org/W2091563385"],"abstract_inverted_index":{"Boolean":[0,17,59,114,135],"satisfiability":[1,15],"(SAT)":[2],"solvers":[3,22,107,149],"are":[4,23],"used":[5],"heavily":[6],"in":[7,37,76,108,121,158],"hardware":[8],"and":[9,30,155],"software":[10],"verification":[11,141],"tools":[12],"for":[13],"checking":[14],"of":[16,56,63,73,78,81,93,100,134,150,160,167],"formulas.":[18,95],"Most":[19],"state-of-the-art":[20],"SAT":[21,46,106,152],"based":[24],"on":[25,50,130,163],"the":[26,32,51,57,71,74,79,86,90,98,101,122,127,147,151,168],"Davis-Putnam-Logemann-Loveland":[27],"(DPLL)":[28],"algorithm":[29,84,88],"require":[31],"input":[33],"formula":[34,65,75],"to":[35,89,110],"be":[36],"conjunctive":[38],"normal":[39,53],"form":[40,54],"(CNF).":[41],"We":[42,96,125],"present":[43],"a":[44,64,118,131,164],"new":[45,128,144],"solver":[47,129,145],"that":[48],"operates":[49],"negation":[52],"(NNF)":[55],"given":[58],"formulas/circuits.":[60],"The":[61,143],"NNF":[62,94],"is":[66],"usually":[67],"more":[68],"succinct":[69],"than":[70],"CNF":[72,105],"terms":[77,159],"number":[80],"variables.":[82],"Our":[83],"applies":[85],"DPLL":[87,123],"graph-based":[91],"representations":[92],"adapt":[97],"idea":[99],"two-watched-literal":[102],"scheme":[103],"from":[104,139],"order":[109],"efficiently":[111],"carry":[112],"out":[113],"Constraint":[115],"Propagation":[116],"(BCP),":[117],"key":[119],"task":[120],"algorithm.":[124],"evaluate":[126],"large":[132,165],"collection":[133],"circuit":[136],"benchmarks":[137],"obtained":[138],"formal":[140],"problems.":[142],"outperforms":[146],"top":[148],"2007":[153],"competition":[154],"SAT-Race":[156],"2008":[157],"run":[161],"time":[162],"majority":[166],"benchmarks.":[169]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}