{"id":"https://openalex.org/W3148125773","doi":"https://doi.org/10.1109/date.2009.5090918","title":"Faster SAT solving with better CNF generation","display_name":"Faster SAT solving with better CNF generation","publication_year":2009,"publication_date":"2009-04-01","ids":{"openalex":"https://openalex.org/W3148125773","doi":"https://doi.org/10.1109/date.2009.5090918","mag":"3148125773"},"language":"en","primary_location":{"id":"doi:10.1109/date.2009.5090918","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2009.5090918","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Design, Automation & Test in Europe Conference & Exhibition","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/A5113995836","display_name":"B. D. Chambers","orcid":null},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"B. Chambers","raw_affiliation_strings":["Northeastern University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University, China","institution_ids":["https://openalex.org/I9224756"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050250788","display_name":"Panagiotis Manolios","orcid":"https://orcid.org/0000-0003-0519-9699"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"P. Manolios","raw_affiliation_strings":["Northeastern University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University, China","institution_ids":["https://openalex.org/I9224756"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007280615","display_name":"Daron Vroon","orcid":null},"institutions":[{"id":"https://openalex.org/I13634446","display_name":"General Theological Seminary","ror":"https://ror.org/02qsgha90","country_code":"US","type":"other","lineage":["https://openalex.org/I13634446"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Vroon","raw_affiliation_strings":["General Theological Seminary of the Episcopal Church"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"General Theological Seminary of the Episcopal Church","institution_ids":["https://openalex.org/I13634446"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7727,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.85919441,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1590","last_page":"1595"},"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.9988999962806702,"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.9980000257492065,"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/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.8581713438034058},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6804180145263672},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6755963563919067},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6710938811302185},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.6014893054962158},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.5432968139648438},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.44848617911338806},{"id":"https://openalex.org/keywords/ranging","display_name":"Ranging","score":0.4325605034828186},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.4223008155822754},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41709086298942566},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36454886198043823},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.23099327087402344}],"concepts":[{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.8581713438034058},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6804180145263672},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6755963563919067},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6710938811302185},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.6014893054962158},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.5432968139648438},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.44848617911338806},{"id":"https://openalex.org/C115051666","wikidata":"https://www.wikidata.org/wiki/Q6522493","display_name":"Ranging","level":2,"score":0.4325605034828186},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4223008155822754},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41709086298942566},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36454886198043823},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23099327087402344},{"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.1109/date.2009.5090918","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2009.5090918","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Design, Automation & Test in Europe Conference & Exhibition","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":17,"referenced_works":["https://openalex.org/W130862334","https://openalex.org/W1494481937","https://openalex.org/W1497632410","https://openalex.org/W1566041312","https://openalex.org/W1996010294","https://openalex.org/W1999997889","https://openalex.org/W2125967324","https://openalex.org/W2126662120","https://openalex.org/W2133527541","https://openalex.org/W2165661129","https://openalex.org/W2768047339","https://openalex.org/W4231695381","https://openalex.org/W4241530675","https://openalex.org/W6629484655","https://openalex.org/W6678730870","https://openalex.org/W6679878532","https://openalex.org/W6684221833"],"related_works":["https://openalex.org/W2558119813","https://openalex.org/W2014111643","https://openalex.org/W2154474334","https://openalex.org/W3107131366","https://openalex.org/W2981948274","https://openalex.org/W1757210337","https://openalex.org/W2796388654","https://openalex.org/W2332241156","https://openalex.org/W2486424993","https://openalex.org/W1531414918"],"abstract_inverted_index":{"Boolean":[0,25],"satisfiability":[1],"(SAT)":[2],"solving":[3,49,81],"has":[4,34],"become":[5],"an":[6],"enabling":[7],"technology":[8],"with":[9],"wide-ranging":[10],"applications":[11,16],"in":[12,38],"numerous":[13],"disciplines.":[14],"These":[15],"tend":[17],"to":[18,28,35,78],"be":[19],"most":[20],"naturally":[21],"encoded":[22],"using":[23],"arbitrary":[24],"expressions,":[26],"but":[27],"use":[29],"modern":[30],"SAT":[31,48,80],"solvers,":[32],"one":[33],"generate":[36],"expressions":[37],"conjunctive":[39],"normal":[40],"form":[41],"(CNF).":[42],"This":[43],"process":[44],"can":[45],"significantly":[46],"affect":[47],"times.":[50],"In":[51],"this":[52],"paper,":[53],"we":[54],"introduce":[55],"a":[56],"new":[57],"linear-time":[58],"CNF":[59,85],"generation":[60],"algorithm.":[61],"We":[62],"have":[63,68],"implemented":[64],"our":[65,75],"algorithm":[66,76],"and":[67,83],"conducted":[69],"extensive":[70],"experiments,":[71],"which":[72],"show":[73],"that":[74],"leads":[77],"faster":[79],"times":[82],"smaller":[84],"than":[86],"existing":[87],"approaches.":[88]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}