{"id":"https://openalex.org/W1999396796","doi":"https://doi.org/10.1145/1536616.1536637","title":"Boolean satisfiability from theoretical hardness to practical success","display_name":"Boolean satisfiability from theoretical hardness to practical success","publication_year":2009,"publication_date":"2009-07-21","ids":{"openalex":"https://openalex.org/W1999396796","doi":"https://doi.org/10.1145/1536616.1536637","mag":"1999396796"},"language":"en","primary_location":{"id":"doi:10.1145/1536616.1536637","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536616.1536637","pdf_url":null,"source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"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":"Communications 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/A5085975362","display_name":"Sharad Malik","orcid":"https://orcid.org/0000-0002-0837-5443"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sharad Malik","raw_affiliation_strings":["Princeton University, Princeton, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101985940","display_name":"Lintao Zhang","orcid":"https://orcid.org/0009-0005-7527-8183"},"institutions":[{"id":"https://openalex.org/I4210113369","display_name":"Microsoft Research Asia (China)","ror":"https://ror.org/0300m5276","country_code":"CN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210113369"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lintao Zhang","raw_affiliation_strings":["Microsoft Research Asia, Beijing, China","Microsoft research Asia, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Asia, Beijing, China","institution_ids":["https://openalex.org/I4210113369"]},{"raw_affiliation_string":"Microsoft research Asia, Beijing, China","institution_ids":["https://openalex.org/I4210113369"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.6379,"has_fulltext":false,"cited_by_count":170,"citation_normalized_percentile":{"value":0.97650688,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"52","issue":"8","first_page":"76","last_page":"82"},"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.9958999752998352,"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.9958999752998352,"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/satisfiability","display_name":"Satisfiability","score":0.7684166431427002},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6957776546478271},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6699289679527283},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.4630432724952698},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.44729194045066833},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4350054860115051},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3621601164340973},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3462463617324829}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7684166431427002},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6957776546478271},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6699289679527283},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.4630432724952698},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.44729194045066833},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4350054860115051},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3621601164340973},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3462463617324829}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1536616.1536637","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536616.1536637","pdf_url":null,"source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"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":"Communications of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W80336116","https://openalex.org/W85863863","https://openalex.org/W94249243","https://openalex.org/W203746830","https://openalex.org/W1481397690","https://openalex.org/W1490969264","https://openalex.org/W1518705996","https://openalex.org/W1667362966","https://openalex.org/W1667614912","https://openalex.org/W1679534293","https://openalex.org/W1709155369","https://openalex.org/W1787074469","https://openalex.org/W1950282396","https://openalex.org/W1984198677","https://openalex.org/W2011039300","https://openalex.org/W2033937366","https://openalex.org/W2036265926","https://openalex.org/W2039027656","https://openalex.org/W2044560939","https://openalex.org/W2049934619","https://openalex.org/W2057361103","https://openalex.org/W2062897452","https://openalex.org/W2066930380","https://openalex.org/W2075959177","https://openalex.org/W2080267935","https://openalex.org/W2086056248","https://openalex.org/W2100126165","https://openalex.org/W2108637261","https://openalex.org/W2118613560","https://openalex.org/W2119190805","https://openalex.org/W2133496820","https://openalex.org/W2133527541","https://openalex.org/W2141303758","https://openalex.org/W2142785340","https://openalex.org/W2147148915","https://openalex.org/W2151398141","https://openalex.org/W2153839473","https://openalex.org/W2160444875","https://openalex.org/W2164392635","https://openalex.org/W2165372647","https://openalex.org/W2279013213","https://openalex.org/W2329627532","https://openalex.org/W2434254232","https://openalex.org/W2498145201","https://openalex.org/W2533347667","https://openalex.org/W2561675875","https://openalex.org/W2886362482","https://openalex.org/W2913459036","https://openalex.org/W3140660692","https://openalex.org/W4285719527","https://openalex.org/W4321359614","https://openalex.org/W4387723197","https://openalex.org/W6605191500","https://openalex.org/W6636950635","https://openalex.org/W6684615325","https://openalex.org/W6684644128"],"related_works":["https://openalex.org/W2408080066","https://openalex.org/W2394616262","https://openalex.org/W192406999","https://openalex.org/W2406837904","https://openalex.org/W3152212242","https://openalex.org/W2014111643","https://openalex.org/W2102364390","https://openalex.org/W1913543287","https://openalex.org/W2336941104","https://openalex.org/W2883069340"],"abstract_inverted_index":{"Satisfiability":[0],"solvers":[1],"can":[2],"now":[3],"be":[4],"effectively":[5],"deployed":[6],"in":[7],"practical":[8],"applications.":[9]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":17},{"year":2017,"cited_by_count":15},{"year":2016,"cited_by_count":17},{"year":2015,"cited_by_count":22},{"year":2014,"cited_by_count":15},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":12}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}