{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007169597,0.001498063,0.001013928,0.003730276,0.001397819,0.00493911,0.004357338,0.002663691,0.006785471],"category_scores_gemma":[0.0428046,0.001788702,0.002451873,0.004864746,0.003069058,0.01179345,0.003400627,0.005698148,0.001691198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002231596,"about_ca_system_score_gemma":0.002480342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001657136,"about_ca_topic_score_gemma":0.002432206,"domain_scores_codex":[0.9908245,0.002220161,0.0007743558,0.001173415,0.004428879,0.0005787427],"domain_scores_gemma":[0.9511798,0.03823892,0.001711398,0.004587971,0.003873558,0.0004083263],"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.0001915155,0.0002586849,0.00206162,0.0008854261,0.000130278,0.0001250946,0.000951229,0.03271686,0.008745896,0.6330213,0.01028423,0.3106279],"study_design_scores_gemma":[0.00003341247,0.00004761877,0.0002574659,0.0001390698,0.00007111007,0.0002031489,0.0001315687,0.1651341,0.007453224,0.8193866,0.007100425,0.00004215958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01031975,0.0006499799,0.9806294,0.000535401,0.00008569236,0.0001722191,0.0002152521,0.0009329015,0.006459407],"genre_scores_gemma":[0.2026831,0.001602259,0.7798618,0.0004477013,0.0004121934,0.0006132631,0.001445353,0.001523575,0.0114107],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007169597,"threshold_uncertainty_score":0.03791696,"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."}}