{"id":"W2170780172","doi":"10.1613/jair.3463","title":"Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems","year":2012,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Heuristics; Constraint satisfaction problem; Computer science; Benchmark (surveying); Constraint programming; Heuristic; Constraint (computer-aided design); Constraint satisfaction; Search tree; Mathematical optimization; Local search (optimization); Theoretical computer science; Search algorithm; Mathematics; Artificial intelligence; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.004417024,0.001277933,0.00158847,0.002082513,0.0007643208,0.001491374,0.002523106,0.001552769,0.002352534],"category_scores_gemma":[0.01876333,0.0006076397,0.001010203,0.004224699,0.001621947,0.002284652,0.001549747,0.002073417,0.0004132998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001796906,"about_ca_system_score_gemma":0.001951939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003806674,"about_ca_topic_score_gemma":0.005127515,"domain_scores_codex":[0.9971411,0.001466381,0.0002067368,0.0003305251,0.0006261749,0.000229042],"domain_scores_gemma":[0.9915023,0.006203283,0.0006743075,0.0008728685,0.0005505565,0.0001967427],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002413432,0.0001912221,0.001900448,0.0003984952,0.0001064366,0.0001095713,0.0002222451,0.646166,0.003650113,0.05468564,0.004239761,0.2880888],"study_design_scores_gemma":[0.0000730566,0.00006495733,0.0001777633,0.0000344029,0.00002400919,0.00005692324,0.00003561327,0.9634135,0.00154731,0.03262223,0.001934307,0.00001590946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01179322,0.000577424,0.9846967,0.0001781661,0.00002830868,0.0001695999,0.00009236686,0.0007648567,0.001699357],"genre_scores_gemma":[0.1842302,0.0004908977,0.8130314,0.0002332015,0.00005121106,0.0003855697,0.000441888,0.0002614339,0.0008741705],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004417024,"threshold_uncertainty_score":0.02335972,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2126970487318262,"score_gpt":0.408101652300917,"score_spread":0.1954046035690908,"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."}}