{"id":"W2076946745","doi":"10.1016/j.ic.2009.05.003","title":"The complexity of constraint satisfaction games and QCSP","year":2009,"lang":"en","type":"article","venue":"Information and Computation","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Ministerio de Educación, Cultura y Deporte","keywords":"Constraint satisfaction problem; Complexity of constraint satisfaction; Constraint satisfaction; Local consistency; Constraint (computer-aided design); Constraint satisfaction dual problem; Mathematics; Predicate (mathematical logic); Surjective function; Sentence; Set (abstract data type); Computer science; Theoretical computer science; Discrete mathematics; Artificial intelligence","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.002481065,0.0009990932,0.002284375,0.001164477,0.002091053,0.0064872,0.002919145,0.002584605,0.01515244],"category_scores_gemma":[0.02515207,0.001064971,0.001922165,0.003239243,0.003278009,0.01144826,0.003083839,0.004694068,0.0006748828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005045694,"about_ca_system_score_gemma":0.004880677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01656329,"about_ca_topic_score_gemma":0.01340747,"domain_scores_codex":[0.9956643,0.00153623,0.0002232984,0.0006507997,0.001231545,0.0006938156],"domain_scores_gemma":[0.9707946,0.02437701,0.001334524,0.001513541,0.001134446,0.0008457884],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002859222,0.0001708471,0.001255932,0.0003162387,0.0001121824,0.0001680012,0.0003741207,0.174,0.0005428608,0.7941092,0.008458029,0.02020657],"study_design_scores_gemma":[0.00005042008,0.00001289709,0.0002277287,0.00001590001,0.0000206832,0.00003620573,0.00006834626,0.1987702,0.0001396566,0.7994757,0.001165892,0.00001633435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.315708,0.002199328,0.5904886,0.01812725,0.0003148961,0.0004283048,0.004248929,0.0007460135,0.06773878],"genre_scores_gemma":[0.8965877,0.001416715,0.08329656,0.0009282341,0.0004296546,0.0004262163,0.002251396,0.0002740694,0.01438946],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01656329,"threshold_uncertainty_score":0.05069,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01776225052734606,"score_gpt":0.2474102144643625,"score_spread":0.2296479639370164,"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."}}