{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006791956,0.0001167365,0.000199786,0.0005935691,0.0004010872,0.0003859244,0.0004163682,0.00009257729,0.00008539693],"category_scores_gemma":[0.001208196,0.0001063935,0.0001304176,0.0006852772,0.0002293018,0.0009162728,0.00006052179,0.0006252225,0.00003302514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002054427,"about_ca_system_score_gemma":0.0005300402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000036908,"about_ca_topic_score_gemma":0.00003714543,"domain_scores_codex":[0.9971641,0.0002968434,0.0007433028,0.0001752698,0.001010022,0.0006104134],"domain_scores_gemma":[0.996358,0.001170434,0.0002595477,0.0002194382,0.001723766,0.0002687798],"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.00007159277,0.000183141,0.003876985,0.00007937827,0.00003074871,0.00000477795,0.00154617,0.04255699,0.006048503,0.1174219,0.0002663295,0.8279135],"study_design_scores_gemma":[0.0001986534,0.0007225528,0.002627636,0.0002296893,0.00001683396,0.0001501035,0.00160333,0.9112295,0.05035222,0.03012172,0.002403871,0.0003438671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01438154,0.0001066208,0.9823598,0.001765804,0.0008410977,0.0003452369,0.000003996275,0.00002835685,0.0001675076],"genre_scores_gemma":[0.9055119,0.00004783325,0.09392729,0.00005551639,0.0004260031,0.000007325733,0.000001085191,0.00001091701,0.00001215186],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8911303,"threshold_uncertainty_score":0.4338601,"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."}}