{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009358671,0.0003908227,0.0004067351,0.0004049304,0.0001666026,0.0005185832,0.002434663,0.000207877,0.0002119578],"category_scores_gemma":[0.0002931753,0.0003823116,0.0001704963,0.000266259,0.0001830289,0.001830858,0.0002083543,0.0002714306,0.0002827276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002252224,"about_ca_system_score_gemma":0.0002972783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007128788,"about_ca_topic_score_gemma":0.000005092425,"domain_scores_codex":[0.9966629,0.0003087361,0.0009686585,0.0008389821,0.0007888738,0.0004319123],"domain_scores_gemma":[0.9957249,0.0005133467,0.0007920504,0.001000173,0.001807189,0.0001623047],"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.0001662591,0.0003708967,0.00002869869,0.00007999266,0.0001636968,0.000001893371,0.001077379,0.009798396,0.2490483,0.4495168,0.009037206,0.2807104],"study_design_scores_gemma":[0.0008220149,0.0006454657,0.0005065697,0.0001262661,0.000009678886,0.000008043537,0.00004103352,0.7259926,0.2449337,0.02637512,0.0001914735,0.0003480088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01242862,0.000007755337,0.9798586,0.001630011,0.002665537,0.001896929,0.00001507101,0.0002164517,0.00128096],"genre_scores_gemma":[0.506542,0.00002223937,0.4924825,0.0002741912,0.0001997626,0.0002709754,0.00003973145,0.00001737364,0.0001511674],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7161942,"threshold_uncertainty_score":0.9998629,"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."}}