{"id":"W2161526001","doi":"10.1109/hldvt.2005.1568836","title":"B-cubing theory: new possibilities for efficient SAT-solving","year":2006,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Correctness; Boolean satisfiability problem; Maximum satisfiability problem; Generalization; Range (aeronautics); Boolean expression; Pruning; Theoretical computer science; Solver; Standard Boolean model; Satisfiability modulo theories; Boolean circuit; And-inverter graph; Boolean function; Programming language; Algorithm; Mathematics","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.003368642,0.0009513443,0.001361751,0.002067483,0.001538345,0.003894536,0.002939387,0.001836932,0.009242802],"category_scores_gemma":[0.01121514,0.001224454,0.001851932,0.002731536,0.003894499,0.008801182,0.004799388,0.004268547,0.002343416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00151746,"about_ca_system_score_gemma":0.001763242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002068071,"about_ca_topic_score_gemma":0.002609249,"domain_scores_codex":[0.9969704,0.00126123,0.0001808212,0.0004260552,0.0008726629,0.0002888435],"domain_scores_gemma":[0.9937965,0.004161946,0.0002003477,0.001249457,0.0004347858,0.0001569948],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001037348,0.00006862601,0.0003306607,0.000277118,0.00003296866,0.00008244511,0.000222849,0.02876016,0.002049903,0.8540468,0.007601121,0.1064235],"study_design_scores_gemma":[0.00004739068,0.00002956616,0.00007254575,0.0001017612,0.00001966269,0.00009737736,0.00006713437,0.1676382,0.002311967,0.8073207,0.02226532,0.00002836157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005200208,0.001018298,0.9789749,0.001467946,0.00010534,0.00006000617,0.0001279881,0.001400496,0.01164469],"genre_scores_gemma":[0.1159404,0.001385054,0.8771017,0.0007218983,0.0001762552,0.0003162832,0.000416865,0.0006988106,0.00324271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009242802,"threshold_uncertainty_score":0.03092027,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02362827668597089,"score_gpt":0.280469644698652,"score_spread":0.2568413680126811,"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."}}