{"id":"W2165528704","doi":"10.2168/lmcs-3(4:6)2007","title":"A Characterisation of First-Order Constraint Satisfaction Problems","year":2007,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"ca_institutions":"Royal Military College of Canada; University of the Fraser Valley; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Constraint satisfaction problem; Decidability; Simple (philosophy); Algebraic number; Constraint satisfaction; Mathematics; Time complexity; Order (exchange); Constraint (computer-aided design); Backtracking; Discrete mathematics; Computer science; Combinatorics; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.001685085,0.000793433,0.0008187122,0.001584715,0.001265309,0.00367792,0.00181038,0.001235477,0.005053286],"category_scores_gemma":[0.006709483,0.0005039164,0.00145912,0.002435685,0.004686796,0.007907329,0.002329062,0.005050889,0.000551955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002078081,"about_ca_system_score_gemma":0.001824954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001724586,"about_ca_topic_score_gemma":0.001744479,"domain_scores_codex":[0.9974383,0.0006552838,0.000175203,0.000691396,0.0007110271,0.0003288263],"domain_scores_gemma":[0.9914698,0.006150888,0.0007442897,0.000715073,0.0005498499,0.0003701016],"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.00002824676,0.00006514513,0.0004868527,0.0001942495,0.00001759134,0.0001407377,0.0004253374,0.009674511,0.002078787,0.9659587,0.001372347,0.01955752],"study_design_scores_gemma":[0.00002477807,0.00003864093,0.0003988173,0.0000464673,0.00001427496,0.0003257379,0.0001934958,0.04984912,0.002974163,0.9315295,0.01457489,0.00003010088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05468134,0.0009651224,0.9107187,0.002630507,0.00008809124,0.0002478757,0.0006400687,0.0007160405,0.02931228],"genre_scores_gemma":[0.6091107,0.001255711,0.3758525,0.0009806174,0.0003011526,0.000518898,0.001331582,0.000187809,0.01046107],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005053286,"threshold_uncertainty_score":0.01690489,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08219768287444364,"score_gpt":0.4122412629926573,"score_spread":0.3300435801182137,"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."}}