{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009388371,0.0001014676,0.00008004928,0.0001082989,0.0001481854,0.0004726756,0.0003109106,0.00004252036,0.00001427066],"category_scores_gemma":[0.0002251441,0.00008335701,0.00005295495,0.0002410627,0.00003081905,0.0002716076,0.00006423383,0.0001066377,0.00007291825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009677736,"about_ca_system_score_gemma":0.0000724112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002878465,"about_ca_topic_score_gemma":8.517694e-7,"domain_scores_codex":[0.9989467,0.00004900946,0.0002316303,0.0003672614,0.0002000837,0.000205288],"domain_scores_gemma":[0.9993429,0.0002064004,0.00004437295,0.0002940733,0.00006781372,0.00004440164],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000021587,0.0000150942,0.000002225401,0.00004355153,0.000004159112,0.000001025849,0.0003931298,0.002388049,0.004977125,0.7537521,0.0001670506,0.2382543],"study_design_scores_gemma":[0.00007261184,0.0001095137,0.00008203775,0.00007756666,0.000002719735,0.000007772159,0.00005061271,0.9432642,0.05312639,0.001769602,0.001328222,0.0001087064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01176477,0.00003283284,0.9749188,0.0005711733,0.0008585716,0.0004796881,0.000001632359,0.0005041472,0.01086833],"genre_scores_gemma":[0.4767689,5.269137e-7,0.5228016,0.0001354445,0.00006798311,0.00004571522,0.000002175705,0.000006545111,0.0001710842],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9408762,"threshold_uncertainty_score":0.4558021,"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."}}