{"id":"W2032487621","doi":"10.1145/1970398.1970400","title":"Complexity of conservative constraint satisfaction problems","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Unary operation; Constraint satisfaction problem; Mathematics; Constraint satisfaction; Constraint (computer-aided design); Constraint logic programming; Set (abstract data type); Constraint programming; Time complexity; Complexity of constraint satisfaction; Mathematical proof; Constraint graph; Local consistency; Constraint satisfaction dual problem; Variable (mathematics); Discrete mathematics; Computer science; Mathematical optimization; Programming language","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.00253899,0.000899161,0.001533691,0.001109462,0.001591641,0.005028519,0.00242991,0.001705794,0.007927727],"category_scores_gemma":[0.02234151,0.000780105,0.001836803,0.00244142,0.002318868,0.00772914,0.003285822,0.003635836,0.0006387244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002549093,"about_ca_system_score_gemma":0.002412698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003618662,"about_ca_topic_score_gemma":0.00308851,"domain_scores_codex":[0.9946123,0.001387564,0.0003995134,0.001003439,0.001847503,0.0007495611],"domain_scores_gemma":[0.975848,0.02001623,0.001356917,0.001232278,0.0009512145,0.0005953596],"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.000494025,0.0003694865,0.004519505,0.001323546,0.0002322392,0.0008531238,0.001800302,0.188233,0.00490579,0.7187564,0.01357538,0.06493719],"study_design_scores_gemma":[0.0001012123,0.00003448502,0.0006093357,0.00004380386,0.00005270306,0.0002730617,0.0003338548,0.1674775,0.001233981,0.8235508,0.006262268,0.00002706809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3349656,0.002319482,0.6031125,0.01176129,0.0001729506,0.0007171681,0.004504636,0.001321858,0.04112459],"genre_scores_gemma":[0.8446661,0.002002414,0.1324489,0.001190617,0.0003760655,0.0007913965,0.005834777,0.0003841152,0.01230563],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007927727,"threshold_uncertainty_score":0.02652085,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1657644237840136,"score_gpt":0.3205390979875744,"score_spread":0.1547746742035607,"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."}}