{"id":"https://openalex.org/W2030228801","doi":"https://doi.org/10.1145/1785481.1785511","title":"Boolean satisfiability on a graphics processor","display_name":"Boolean satisfiability on a graphics processor","publication_year":2010,"publication_date":"2010-05-16","ids":{"openalex":"https://openalex.org/W2030228801","doi":"https://doi.org/10.1145/1785481.1785511","mag":"2030228801"},"language":"en","primary_location":{"id":"doi:10.1145/1785481.1785511","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1785481.1785511","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th symposium on Great lakes symposium on VLSI","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/A5012099201","display_name":"Kanupriya Gulati","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kanupriya Gulati","raw_affiliation_strings":["Texas A&M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021685706","display_name":"Sunil P. Khatri","orcid":"https://orcid.org/0000-0001-7134-9929"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sunil P. Khatri","raw_affiliation_strings":["Texas A&M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5012099201"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":1.0036,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.76252226,"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":"123","last_page":"126"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.998199999332428,"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.998199999332428,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9908999800682068,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9897000193595886,"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.7262313365936279},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.724932849407196},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6579154133796692},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6257619857788086},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.5938712954521179},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.550530195236206},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.47830846905708313},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.46239885687828064},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4381866753101349},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.4324369430541992},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4268014430999756},{"id":"https://openalex.org/keywords/graphics","display_name":"Graphics","score":0.41793879866600037},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.4172346293926239},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34052225947380066},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21422290802001953},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1364930272102356}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7262313365936279},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.724932849407196},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6579154133796692},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6257619857788086},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.5938712954521179},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.550530195236206},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.47830846905708313},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.46239885687828064},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4381866753101349},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4324369430541992},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4268014430999756},{"id":"https://openalex.org/C21442007","wikidata":"https://www.wikidata.org/wiki/Q1027879","display_name":"Graphics","level":2,"score":0.41793879866600037},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.4172346293926239},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34052225947380066},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21422290802001953},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1364930272102356},{"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/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1785481.1785511","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1785481.1785511","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th symposium on Great lakes symposium on VLSI","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1515239800","https://openalex.org/W1597508330","https://openalex.org/W1942651816","https://openalex.org/W1982132112","https://openalex.org/W1982531027","https://openalex.org/W1985433906","https://openalex.org/W2036265926","https://openalex.org/W2048051309","https://openalex.org/W2081642252","https://openalex.org/W2131367934","https://openalex.org/W2141579716","https://openalex.org/W2142785340","https://openalex.org/W3102577161","https://openalex.org/W4387723197","https://openalex.org/W6640376922","https://openalex.org/W6679669827"],"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/W2111523115","https://openalex.org/W4234414781","https://openalex.org/W4289743389","https://openalex.org/W2883069340","https://openalex.org/W2996462315"],"abstract_inverted_index":{"Boolean":[0,27],"Satisfiability":[1],"(SAT)":[2],"is":[3],"a":[4,26,31,56],"core":[5],"NP-complete":[6],"problem.":[7,20],"Several":[8],"heuristic":[9],"software":[10],"and":[11,44],"hardware":[12],"approaches":[13],"have":[14],"been":[15],"proposed":[16],"to":[17],"solve":[18],"this":[19,22],"In":[21],"paper":[23],"we":[24],"present":[25],"satisfiablity":[28],"approach":[29],"with":[30],"new":[32],"GPU-enhanced":[33],"variable":[34],"ordering":[35],"heuristic.":[36],"Our":[37],"results":[38],"demonstrate":[39],"that":[40],"over":[41,61],"several":[42],"satisfiable":[43],"unsatisfiable":[45],"benchmarks,":[46],"our":[47],"technique":[48],"(MESP)":[49],"performs":[50],"better":[51],"than":[52],"MiniSAT.":[53],"We":[54],"show":[55],"2.35\u00d7":[57],"speedup":[58],"on":[59],"average,":[60],"68":[62],"from":[63],"the":[64],"SAT":[65],"Race":[66],"(2008)":[67],"competition.":[68]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}