{"id":"W4399487396","doi":"10.1145/3649476.3658808","title":"Accelerating Boolean Constraint Propagation for Efficient SAT-Solving on FPGAs","year":2024,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Field-programmable gate array; Constraint (computer-aided design); Parallel computing; Boolean satisfiability problem; Boolean function; Theoretical computer science; Algorithm; Mathematics; Embedded 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.0003259447,0.0008223981,0.0003634849,0.0005456572,0.0003089872,0.0006888522,0.0009007668,0.0003801617,0.01151072],"category_scores_gemma":[0.001378554,0.0003003325,0.0004385526,0.0007558301,0.0003382352,0.0008742653,0.0006299828,0.0008932456,0.001537782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005140079,"about_ca_system_score_gemma":0.001115549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002439093,"about_ca_topic_score_gemma":0.006519484,"domain_scores_codex":[0.9995638,0.0001058222,0.00002558869,0.00007281952,0.0001539742,0.0000780116],"domain_scores_gemma":[0.999445,0.000301344,0.00004469883,0.00008780574,0.00009843544,0.00002275175],"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.0003264789,0.0002224907,0.001385593,0.0005633968,0.00008467761,0.0003842406,0.0001116882,0.3173076,0.06618593,0.05997769,0.01304474,0.5404055],"study_design_scores_gemma":[0.0001163498,0.0001466453,0.0002903624,0.00003354224,0.00003104986,0.0001492681,0.00003774793,0.941369,0.0324083,0.01344211,0.01196044,0.00001516961],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04203719,0.0003764776,0.9393032,0.0002543074,0.00008311516,0.00009545617,0.0001850378,0.005458139,0.012207],"genre_scores_gemma":[0.3353628,0.0003261367,0.6595973,0.0001504067,0.00003934404,0.0001206898,0.0004364946,0.000357811,0.003608964],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01151072,"threshold_uncertainty_score":0.03850722,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06124641551256968,"score_gpt":0.3272905061577154,"score_spread":0.2660440906451457,"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."}}