{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00237429,0.001205765,0.001183934,0.001736061,0.001195319,0.003359235,0.003707006,0.002357241,0.004662628],"category_scores_gemma":[0.01086854,0.0007562826,0.001722305,0.002794834,0.001488492,0.004786589,0.003112377,0.003384253,0.001441762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00134478,"about_ca_system_score_gemma":0.002892609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002977883,"about_ca_topic_score_gemma":0.004345463,"domain_scores_codex":[0.9968625,0.001035706,0.0002545206,0.0004084115,0.00117699,0.0002619254],"domain_scores_gemma":[0.9953825,0.002271963,0.00038659,0.001172599,0.0006625767,0.0001237103],"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.0004531705,0.0003631821,0.0006603099,0.0005930456,0.0000891353,0.0002590698,0.0009677918,0.3521853,0.0103487,0.145425,0.009881447,0.4787738],"study_design_scores_gemma":[0.0001512878,0.0002052022,0.0001353746,0.00009101094,0.00005497806,0.0001356983,0.0001513583,0.8585337,0.009776033,0.1197891,0.01091905,0.00005711327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005806259,0.0001281433,0.9908222,0.0002392929,0.00003320389,0.0001254659,0.0001825948,0.00128609,0.001376801],"genre_scores_gemma":[0.08441039,0.0002027298,0.9115469,0.0001926811,0.00003541487,0.0004033713,0.0008372241,0.0004015506,0.001969747],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004662628,"threshold_uncertainty_score":0.01559806,"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."}}