{"id":"W1488026446","doi":"10.1007/11814948_31","title":"Characterizing Propagation Methods for Boolean Satisfiability","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Computer science; Belief propagation; Satisfiability; Equivalence (formal languages); Local consistency; Convergence (economics); Theoretical computer science; Algorithm; Mathematical optimization; Maximization; Boolean satisfiability problem; Constraint satisfaction problem; Mathematics; Discrete mathematics; Artificial intelligence; Probabilistic logic","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.003598908,0.000585202,0.0006360498,0.0007927315,0.0003367349,0.0005981284,0.003065762,0.0003942693,0.000004690648],"category_scores_gemma":[0.0004412086,0.0005678645,0.0002038255,0.0005416801,0.0004676292,0.0008177549,0.001081974,0.0007671497,0.00000684018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006102141,"about_ca_system_score_gemma":0.00050046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004627224,"about_ca_topic_score_gemma":0.00004981308,"domain_scores_codex":[0.995817,0.0001081979,0.0007548525,0.001987302,0.0006120068,0.0007206463],"domain_scores_gemma":[0.9958711,0.001248101,0.0005471631,0.001776664,0.000440126,0.0001168754],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003972562,0.00001876962,0.00004757858,0.00007175199,0.000004247954,0.000004674881,0.0003109132,0.001005788,0.002407134,0.01038569,0.00002861669,0.9857109],"study_design_scores_gemma":[0.0001468038,0.0002257602,0.0002349996,0.0003107938,0.000009628162,0.00003504736,5.997374e-8,0.6306471,0.03197622,0.3327391,0.002902617,0.0007719168],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004079792,0.0001357399,0.992868,0.0007414612,0.001922923,0.001309138,0.000004524198,0.0007963578,0.002181026],"genre_scores_gemma":[0.03113753,0.000005436927,0.967372,0.0007110387,0.0004218668,0.00006615111,0.00001071576,0.00004939569,0.0002258904],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.984939,"threshold_uncertainty_score":0.9996773,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0264668208049978,"score_gpt":0.3191663136039671,"score_spread":0.2926994927989693,"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."}}