{"id":"https://openalex.org/W2171739643","doi":"https://doi.org/10.3233/sat190040","title":"Parallel SAT Solving using Bit-level Operations1","display_name":"Parallel SAT Solving using Bit-level Operations1","publication_year":2008,"publication_date":"2008-05-01","ids":{"openalex":"https://openalex.org/W2171739643","doi":"https://doi.org/10.3233/sat190040","mag":"2171739643"},"language":"en","primary_location":{"id":"doi:10.3233/sat190040","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190040","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190040?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190040","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190040?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190040","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025921874","display_name":"Marijn J. H. Heule","orcid":"https://orcid.org/0000-0002-5587-8801"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Marijn Heule","raw_affiliation_strings":["Department of Software Technology, Delft University of Technology, The Netherlands. E-mails:\u00a0marijn@heule.nl,\u00a0h.vanmaaren@ewi.tudelft.nl"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Software Technology, Delft University of Technology, The Netherlands. E-mails:\u00a0marijn@heule.nl,\u00a0h.vanmaaren@ewi.tudelft.nl","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084566377","display_name":"Hans van Maaren","orcid":null},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Hans van Maaren","raw_affiliation_strings":["Department of Software Technology, Delft University of Technology, The Netherlands. E-mails:\u00a0marijn@heule.nl,\u00a0h.vanmaaren@ewi.tudelft.nl"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Software Technology, Delft University of Technology, The Netherlands. E-mails:\u00a0marijn@heule.nl,\u00a0h.vanmaaren@ewi.tudelft.nl","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5025921874"],"corresponding_institution_ids":["https://openalex.org/I98358874"],"apc_list":null,"apc_paid":null,"fwci":0.3937,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.70535048,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"4","issue":"2-4","first_page":"99","last_page":"116"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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.9997000098228455,"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.9993000030517578,"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.9986000061035156,"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/computer-science","display_name":"Computer science","score":0.7793945074081421},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.7230331897735596},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.6315996050834656},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.59810471534729},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5817428827285767},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5592228174209595},{"id":"https://openalex.org/keywords/bit","display_name":"Bit (key)","score":0.4741850793361664},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4231947064399719},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4193669557571411},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.41870784759521484},{"id":"https://openalex.org/keywords/parallel-architecture","display_name":"Parallel architecture","score":0.411583811044693},{"id":"https://openalex.org/keywords/architecture","display_name":"Architecture","score":0.23261097073554993},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08627903461456299}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7793945074081421},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.7230331897735596},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6315996050834656},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.59810471534729},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5817428827285767},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5592228174209595},{"id":"https://openalex.org/C117011727","wikidata":"https://www.wikidata.org/wiki/Q1278488","display_name":"Bit (key)","level":2,"score":0.4741850793361664},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4231947064399719},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4193669557571411},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.41870784759521484},{"id":"https://openalex.org/C2985918086","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel architecture","level":3,"score":0.411583811044693},{"id":"https://openalex.org/C123657996","wikidata":"https://www.wikidata.org/wiki/Q12271","display_name":"Architecture","level":2,"score":0.23261097073554993},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08627903461456299},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/sat190040","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190040","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190040?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190040","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},{"id":"pmh:oai:tudelft.nl:uuid:e4e65262-6c0c-4c19-ad75-80dc56380dd5","is_oa":false,"landing_page_url":"http://resolver.tudelft.nl/uuid:e4e65262-6c0c-4c19-ad75-80dc56380dd5","pdf_url":null,"source":{"id":"https://openalex.org/S4306400906","display_name":"Research Repository (Delft University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98358874","host_organization_name":"Delft University of Technology","host_organization_lineage":["https://openalex.org/I98358874"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"journal article"}],"best_oa_location":{"id":"doi:10.3233/sat190040","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190040","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190040?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190040","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2171739643.pdf","grobid_xml":"https://content.openalex.org/works/W2171739643.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1515882985","https://openalex.org/W1566273688","https://openalex.org/W1589464585","https://openalex.org/W1952128916","https://openalex.org/W2026355757","https://openalex.org/W2046612382","https://openalex.org/W2092775861","https://openalex.org/W2103662379","https://openalex.org/W2123098314","https://openalex.org/W2165372647","https://openalex.org/W2169084680","https://openalex.org/W2174076392","https://openalex.org/W4253362517"],"related_works":["https://openalex.org/W2115480761","https://openalex.org/W4386614288","https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W2091617677","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W1913543287","https://openalex.org/W2268872489","https://openalex.org/W2920896101"],"abstract_inverted_index":{"We":[0],"show":[1],"how":[2],"to":[3,12,25,49],"exploit":[4],"the":[5,16],"32/64":[6],"bit":[7,42],"architecture":[8],"of":[9,15,45,68],"modern":[10],"computers":[11],"accelerate":[13],"some":[14],"algorithms":[17],"used":[18],"in":[19,27],"satisfiability":[20],"solving":[21],"by":[22],"modifying":[23],"assignments":[24],"variables":[26],"parallel":[28],"on":[29],"a":[30],"single":[31],"processor.":[32],"Techniques":[33],"such":[34],"as":[35,74],"random":[36],"sampling":[37],"demonstrate":[38],"that":[39,59],"while":[40],"using":[41],"vectors":[43],"instead":[44],"Boolean":[46],"values":[47],"solutions":[48],"satisfiable":[50],"formulae":[51],"can":[52,70],"be":[53,71],"obtained":[54],"faster.":[55],"Here,":[56],"we":[57],"reveal":[58],"more":[60],"complex":[61],"algorithms,":[62],"like":[63],"unit":[64],"propagation":[65],"and":[66],"detection":[67],"autarkies,":[69],"parallelized":[72],"efficiently,":[73],"well.":[75]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}