{"id":"W1575452963","doi":"10.1613/jair.788","title":"Conflict-Directed Backjumping Revisited","year":2001,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backtracking; Look-ahead; Beam stack search; Constraint learning; Consistency (knowledge bases); Local consistency; Heuristic; Computer science; Constraint satisfaction problem; Focus (optics); Constraint (computer-aided design); Mathematical optimization; Algorithm; Contrast (vision); Constraint satisfaction; Search algorithm; Mathematics; Artificial intelligence; Incremental heuristic search; Beam search","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.002989935,0.00009018095,0.0001892185,0.000730199,0.0002326174,0.0003755818,0.0007112829,0.00007277869,0.0004856511],"category_scores_gemma":[0.001010364,0.00007997937,0.00009865154,0.00189516,0.000134482,0.0007034949,0.0001102479,0.000584496,0.0001871228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001125705,"about_ca_system_score_gemma":0.0002509718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001813125,"about_ca_topic_score_gemma":0.00001332352,"domain_scores_codex":[0.9975235,0.0003450253,0.0006872815,0.0001928906,0.0008900285,0.0003612088],"domain_scores_gemma":[0.9969949,0.0004433955,0.0002132012,0.0002744553,0.001873086,0.0002009813],"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.00008028609,0.0001112604,0.0006649866,0.000009885238,0.000031661,0.0001807167,0.001041329,0.001697137,0.00857255,0.05620814,0.001375079,0.9300269],"study_design_scores_gemma":[0.000182253,0.0009001982,0.002936948,0.0004223748,0.000015233,0.001387485,0.001960676,0.8437591,0.05555571,0.03990287,0.05244819,0.0005289305],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01539029,0.0002397966,0.9774647,0.00298875,0.0003790898,0.0001334424,4.799164e-7,0.00006162696,0.003341817],"genre_scores_gemma":[0.9570758,0.001439995,0.04060103,0.0001389024,0.0004286122,0.000002308865,8.479052e-7,0.0000114902,0.0003010365],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9416855,"threshold_uncertainty_score":0.5317539,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2109980789570575,"score_gpt":0.4285933742557623,"score_spread":0.2175952952987048,"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."}}