{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002996451,0.001084859,0.001452652,0.001144364,0.001392808,0.001754437,0.004042278,0.001575383,0.004145621],"category_scores_gemma":[0.01124012,0.0009769218,0.00152872,0.003241691,0.002569134,0.00306983,0.002195892,0.003989325,0.0007569704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001476903,"about_ca_system_score_gemma":0.002072828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007300815,"about_ca_topic_score_gemma":0.006748482,"domain_scores_codex":[0.9963959,0.001110513,0.000194146,0.0005969481,0.001334343,0.0003681231],"domain_scores_gemma":[0.990699,0.004756548,0.0005825026,0.002426479,0.001272849,0.0002626707],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005743664,0.0005006729,0.006569677,0.001592414,0.0003276474,0.0008201448,0.001314793,0.2240378,0.01513967,0.1539164,0.01454788,0.5806585],"study_design_scores_gemma":[0.0002305987,0.0002969047,0.002042311,0.0001629315,0.0003092758,0.001466609,0.0003369143,0.7848572,0.03418275,0.1338502,0.04212702,0.000137292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08283518,0.007856597,0.8884766,0.002135949,0.0003852264,0.0002988499,0.0002389452,0.003919553,0.01385315],"genre_scores_gemma":[0.4612482,0.002841089,0.5271543,0.00111365,0.0001659142,0.0001891921,0.0004146152,0.0006250442,0.006247989],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007300815,"threshold_uncertainty_score":0.01584691,"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."}}