{"id":"W2105084236","doi":"10.1109/icci.1992.227654","title":"Reduction of constraint networks based on local consistency","year":2003,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Constraint satisfaction problem; Consistency (knowledge bases); Constraint (computer-aided design); Local consistency; Constraint satisfaction; Reduction (mathematics); Class (philosophy); Computer science; Mathematical optimization; Theoretical computer science; Constraint programming; 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.001822178,0.001086861,0.001376814,0.001650778,0.001752458,0.001842536,0.00333968,0.001115182,0.009155895],"category_scores_gemma":[0.009231237,0.0007507092,0.002202474,0.002285282,0.00156945,0.003398167,0.003973157,0.004569043,0.001633936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001557007,"about_ca_system_score_gemma":0.002420167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005720358,"about_ca_topic_score_gemma":0.007773516,"domain_scores_codex":[0.9967752,0.000992915,0.000132043,0.000598326,0.001203817,0.0002976666],"domain_scores_gemma":[0.9957314,0.002176618,0.0002511793,0.001070554,0.0006374986,0.0001326881],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002112506,0.0003109002,0.0008611157,0.000528676,0.0002279739,0.0004328646,0.0004527309,0.4473654,0.01437655,0.2471126,0.01253881,0.275581],"study_design_scores_gemma":[0.00007954665,0.0000967771,0.0003655815,0.00006565901,0.00009974626,0.000191947,0.0001547197,0.7096597,0.01472759,0.2498338,0.02467309,0.00005180367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005536912,0.0001471025,0.9878789,0.0002204959,0.00006106236,0.0001613471,0.0001290323,0.00058918,0.005275859],"genre_scores_gemma":[0.1516407,0.0004460446,0.8313236,0.0003903993,0.0001140423,0.0009141093,0.001200481,0.001028162,0.01294251],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009155895,"threshold_uncertainty_score":0.03062952,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01110240025926927,"score_gpt":0.2173966978123194,"score_spread":0.2062942975530501,"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."}}