{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000175196,0.00006212114,0.00006926864,0.00007454691,0.0001990151,0.0001994117,0.00005096711,0.0000290101,0.000002783883],"category_scores_gemma":[0.00002840045,0.00004965562,0.00001503757,0.0001285669,0.0001665748,0.001086296,0.00001937434,0.00005078502,0.000002574066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001278763,"about_ca_system_score_gemma":0.00002709177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001560766,"about_ca_topic_score_gemma":0.00001108127,"domain_scores_codex":[0.9994357,0.00003177281,0.0002699789,0.00006688283,0.0001241703,0.00007147311],"domain_scores_gemma":[0.9995357,0.00006052597,0.0001751233,0.0000741687,0.0001173867,0.00003705882],"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.000003732209,0.000002299354,0.0004122739,0.000004029826,0.000002588119,3.825165e-8,0.0005293504,0.0005560817,0.00002174534,0.2217159,0.00005092119,0.7767011],"study_design_scores_gemma":[0.0004127365,0.0000796118,0.4422566,0.00001167783,0.000003507654,0.00003480892,0.0003432143,0.5223083,0.0001160484,0.03372984,0.0006145247,0.00008913771],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03575245,0.00004071354,0.9592411,0.003135141,0.0001027387,0.0001440413,0.000002000343,0.00006953243,0.001512284],"genre_scores_gemma":[0.9845179,0.00009138959,0.01505792,0.0003145305,0.000005893468,0.000001638826,0.000006721679,7.257605e-7,0.000003257064],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9487655,"threshold_uncertainty_score":0.2024898,"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."}}