{"id":"W2151273784","doi":"10.1142/s0218213008004114","title":"A SPACE-EFFICIENT BACKTRACK-FREE REPRESENTATION FOR CONSTRAINT SATISFACTION PROBLEMS","year":2008,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Pruning; Heuristics; Constraint satisfaction problem; Backtracking; Constraint satisfaction; Representation (politics); Local consistency; Constraint (computer-aided design); Space (punctuation); Search tree; Tuple; Mathematical optimization; Consistency (knowledge bases); Algorithm; Variety (cybernetics); Search algorithm; Artificial intelligence; Mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005247743,0.0001554311,0.0002138251,0.0003930776,0.0001603131,0.0002974698,0.0008270106,0.00008090343,0.000147691],"category_scores_gemma":[0.001009576,0.0001501205,0.0002285153,0.0002926282,0.0001565055,0.001026918,0.00009044963,0.0001980183,0.0000321583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001870991,"about_ca_system_score_gemma":0.000278164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002808339,"about_ca_topic_score_gemma":0.00003286441,"domain_scores_codex":[0.9976944,0.00006834202,0.0009900521,0.000268323,0.0007703985,0.0002084722],"domain_scores_gemma":[0.9968543,0.0003807181,0.0007237822,0.0002770018,0.001643967,0.0001202068],"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.0001626679,0.0002034116,0.0009988258,0.000008071848,0.0001410908,0.00006509981,0.002053386,0.242807,0.006252302,0.1771949,0.0009745783,0.5691386],"study_design_scores_gemma":[0.0009202564,0.0007441604,0.01289719,0.0002194776,0.00004866336,0.003319089,0.001349293,0.8239981,0.07904508,0.07370215,0.002999374,0.0007571585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03454256,0.00003154494,0.9575817,0.004401871,0.00259186,0.0003369956,0.00001975561,0.00005133603,0.0004423677],"genre_scores_gemma":[0.8948734,0.0001052486,0.1044278,0.0001330608,0.0003851977,0.00001484259,0.000006149958,0.00001020892,0.0000440099],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8603309,"threshold_uncertainty_score":0.6121737,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09226414483271571,"score_gpt":0.3272275692207837,"score_spread":0.2349634243880679,"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."}}