{"id":"https://openalex.org/W2113692904","doi":"https://doi.org/10.1109/date.2011.5763199","title":"A reconfigurable, pipelined, conflict directed jumping search SAT solver","display_name":"A reconfigurable, pipelined, conflict directed jumping search SAT solver","publication_year":2011,"publication_date":"2011-03-01","ids":{"openalex":"https://openalex.org/W2113692904","doi":"https://doi.org/10.1109/date.2011.5763199","mag":"2113692904"},"language":"en","primary_location":{"id":"doi:10.1109/date.2011.5763199","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2011.5763199","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Design, Automation &amp; Test in Europe","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":null,"display_name":"M Safar","orcid":null},"institutions":[{"id":"https://openalex.org/I107720978","display_name":"Ain Shams University","ror":"https://ror.org/00cb9w016","country_code":"EG","type":"education","lineage":["https://openalex.org/I107720978"]}],"countries":["EG"],"is_corresponding":true,"raw_author_name":"M Safar","raw_affiliation_strings":["Department of Computer and Systems Engineering, Ain Shams University, Cairo, Egypt","Ain Shams University, Department of Computer and Systems, Engineering, Cairo, Egypt"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Systems Engineering, Ain Shams University, Cairo, Egypt","institution_ids":["https://openalex.org/I107720978"]},{"raw_affiliation_string":"Ain Shams University, Department of Computer and Systems, Engineering, Cairo, Egypt","institution_ids":["https://openalex.org/I107720978"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056943013","display_name":"M. Watheq El\u2010Kharashi","orcid":"https://orcid.org/0000-0002-6033-733X"},"institutions":[{"id":"https://openalex.org/I107720978","display_name":"Ain Shams University","ror":"https://ror.org/00cb9w016","country_code":"EG","type":"education","lineage":["https://openalex.org/I107720978"]}],"countries":["EG"],"is_corresponding":false,"raw_author_name":"M W El-Kharashi","raw_affiliation_strings":["Department of Computer and Systems Engineering, Ain Shams University, Cairo, Egypt","Ain Shams University, Department of Computer and Systems, Engineering, Cairo, Egypt"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Systems Engineering, Ain Shams University, Cairo, Egypt","institution_ids":["https://openalex.org/I107720978"]},{"raw_affiliation_string":"Ain Shams University, Department of Computer and Systems, Engineering, Cairo, Egypt","institution_ids":["https://openalex.org/I107720978"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038110146","display_name":"Mohamed Shalan","orcid":"https://orcid.org/0000-0003-2255-6328"},"institutions":[{"id":"https://openalex.org/I80693520","display_name":"American University in Cairo","ror":"https://ror.org/0176yqn58","country_code":"EG","type":"education","lineage":["https://openalex.org/I80693520"]}],"countries":["EG"],"is_corresponding":false,"raw_author_name":"M Shalan","raw_affiliation_strings":["American University, Cairo, Cairo, Egypt","American Univ. in Cairo, Cairo, Egypt"],"affiliations":[{"raw_affiliation_string":"American University, Cairo, Cairo, Egypt","institution_ids":["https://openalex.org/I80693520"]},{"raw_affiliation_string":"American Univ. in Cairo, Cairo, Egypt","institution_ids":["https://openalex.org/I80693520"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070409088","display_name":"Ahmed Salem","orcid":"https://orcid.org/0000-0002-0999-4000"},"institutions":[{"id":"https://openalex.org/I105695857","display_name":"Siemens (Hungary)","ror":"https://ror.org/01rk7mv85","country_code":"HU","type":"company","lineage":["https://openalex.org/I105695857","https://openalex.org/I1325886976"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"A Salem","raw_affiliation_strings":["Mentor Graphics Egypt, Cairo, Egypt","Mentor Graphics Egypt, Cairo, Egypt#TAB#"],"affiliations":[{"raw_affiliation_string":"Mentor Graphics Egypt, Cairo, Egypt","institution_ids":[]},{"raw_affiliation_string":"Mentor Graphics Egypt, Cairo, Egypt#TAB#","institution_ids":["https://openalex.org/I105695857"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I107720978"],"apc_list":null,"apc_paid":null,"fwci":1.6276,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.84054821,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9977999925613403,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9948999881744385,"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.7834516763687134},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.7554296255111694},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.7540187835693359},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.635374903678894},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5986167788505554},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5927446484565735},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5432050228118896},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4225804805755615},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.41788822412490845},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.41567254066467285},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3515230417251587},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26016637682914734},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.2346077859401703},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16601642966270447}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7834516763687134},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.7554296255111694},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.7540187835693359},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.635374903678894},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5986167788505554},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5927446484565735},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5432050228118896},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4225804805755615},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.41788822412490845},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.41567254066467285},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3515230417251587},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26016637682914734},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2346077859401703},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16601642966270447},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/date.2011.5763199","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2011.5763199","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Design, Automation &amp; Test in Europe","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":22,"referenced_works":["https://openalex.org/W1500253836","https://openalex.org/W1558180718","https://openalex.org/W1711753553","https://openalex.org/W1923495615","https://openalex.org/W1979411114","https://openalex.org/W2021700650","https://openalex.org/W2037461268","https://openalex.org/W2044560939","https://openalex.org/W2050918004","https://openalex.org/W2057361103","https://openalex.org/W2069523538","https://openalex.org/W2096307462","https://openalex.org/W2103406716","https://openalex.org/W2136950039","https://openalex.org/W2147148915","https://openalex.org/W2150642420","https://openalex.org/W2567722231","https://openalex.org/W2913258176","https://openalex.org/W4251625379","https://openalex.org/W6629684237","https://openalex.org/W6674427772","https://openalex.org/W6680411291"],"related_works":["https://openalex.org/W4251667305","https://openalex.org/W1567684443","https://openalex.org/W2356927372","https://openalex.org/W1537803214","https://openalex.org/W2123081449","https://openalex.org/W2148369462","https://openalex.org/W1602213077","https://openalex.org/W2782660180","https://openalex.org/W1558180718","https://openalex.org/W2282636749"],"abstract_inverted_index":{"Several":[0],"approaches":[1],"have":[2],"been":[3],"proposed":[4,86],"to":[5,90],"accelerate":[6],"the":[7],"NP-complete":[8],"Boolean":[9],"Satisfiability":[10],"problem":[11],"(SAT)":[12],"using":[13],"reconfigurable":[14],"computing.":[15],"In":[16],"this":[17],"paper,":[18],"we":[19],"present":[20],"a":[21,48],"five-stage":[22],"pipelined":[23],"SAT":[24,26,54,70,96],"solver.":[25],"solving":[27],"is":[28,73],"broken":[29],"into":[30,75],"five":[31],"stages:":[32],"variable":[33,35],"decision,":[34],"effect":[36],"fetch,":[37],"clause":[38],"evaluation,":[39],"conflict":[40,43],"detection,":[41],"and":[42,62],"analysis.":[44],"The":[45,85],"solver":[46,87],"performs":[47],"novel":[49],"search":[50],"algorithm":[51],"combining":[52],"state-of-the-art":[53],"solvers":[55,97],"advanced":[56],"techniques:":[57],"non-chronological":[58],"backjumping,":[59],"dynamic":[60],"backtracking":[61],"learning":[63],"without":[64],"explicit":[65],"traversal":[66],"of":[67],"implication":[68],"graph.":[69],"instance":[71],"information":[72],"stored":[74],"FPGA":[76],"block":[77],"RAMs":[78],"avoiding":[79],"synthesizing":[80],"overhead":[81],"for":[82],"each":[83],"instance.":[84],"achieves":[88],"up":[89],"70\u00d7":[91],"speedup":[92],"over":[93],"other":[94],"hardware":[95],"with":[98],"200\u00d7":[99],"less":[100],"resource":[101],"utilization.":[102]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-25T23:56:10.502304","created_date":"2025-10-10T00:00:00"}
