{"id":"W4237740194","doi":"10.1109/iccad.2013.6691124","title":"FPGA acceleration of enhanced boolean constraint propagation for SAT solvers","year":2013,"lang":"en","type":"article","venue":"2013 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Hardware acceleration; Field-programmable gate array; Parallel computing; Boolean satisfiability problem; Gate array; Embedded system; Software; Multi-core processor; Computer architecture; Computer hardware; Theoretical computer science; Operating system","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002291892,0.0006368245,0.0002834052,0.0005363955,0.0002119538,0.0006026502,0.001127367,0.0002852448,0.0113645],"category_scores_gemma":[0.0008185324,0.0003099426,0.0003206683,0.0006082609,0.0001732052,0.0006380882,0.0003127849,0.0005837899,0.001439928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005771019,"about_ca_system_score_gemma":0.0007061579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002903162,"about_ca_topic_score_gemma":0.005737643,"domain_scores_codex":[0.9996146,0.0000725951,0.00002806199,0.00006564816,0.000154657,0.00006449025],"domain_scores_gemma":[0.999566,0.000165007,0.00004322191,0.00008201044,0.0001216516,0.0000219808],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001100683,0.0003857281,0.003666678,0.0007686117,0.0001640857,0.0006899525,0.0001308769,0.1274873,0.1785826,0.02456899,0.02109488,0.6413597],"study_design_scores_gemma":[0.0002342872,0.0007204196,0.001996096,0.00004174581,0.00009272583,0.0004273401,0.00002891587,0.8496045,0.1197101,0.002769459,0.02433348,0.00004091035],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1595629,0.001025699,0.7799941,0.0005076129,0.0003185446,0.0002257237,0.0005069076,0.02263725,0.03522126],"genre_scores_gemma":[0.5960974,0.0002687302,0.3964625,0.0002557408,0.00005702665,0.0001008491,0.000751712,0.0002457997,0.005760254],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0113645,"threshold_uncertainty_score":0.03801799,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1346806322324103,"score_gpt":0.3298127657875132,"score_spread":0.1951321335551029,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}