{"id":"W2175971376","doi":"10.1287/ijoc.2015.0654","title":"Achieving Domain Consistency and Counting Solutions for Dispersion Constraints","year":2015,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Heuristics; Consistency (knowledge bases); Benchmark (surveying); Mathematical optimization; Constraint programming; Constraint satisfaction; Computer science; Constraint satisfaction problem; Local consistency; Domain (mathematical analysis); Constraint (computer-aided design); Set (abstract data type); Heuristic; Mathematics; Algorithm; Stochastic programming; 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.007733529,0.001915651,0.001949362,0.002685941,0.001633356,0.003479747,0.003248033,0.0027742,0.005014282],"category_scores_gemma":[0.04982541,0.001095085,0.002249741,0.003929305,0.002263043,0.006312539,0.004058387,0.004170545,0.0009493682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0016047,"about_ca_system_score_gemma":0.00331261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002416467,"about_ca_topic_score_gemma":0.002923269,"domain_scores_codex":[0.9916123,0.003694544,0.0004793991,0.001277649,0.002237,0.0006990536],"domain_scores_gemma":[0.9726015,0.02089004,0.001367331,0.002909415,0.001833984,0.0003977391],"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.0002370108,0.0003344867,0.002724553,0.0004663317,0.0001427302,0.00023975,0.0005518677,0.4388511,0.00497769,0.3053537,0.008696307,0.2374245],"study_design_scores_gemma":[0.00007157849,0.00008196378,0.000217285,0.00008407162,0.0000424647,0.0001241109,0.0001801884,0.7468912,0.004406851,0.2437399,0.004132106,0.00002828918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01220163,0.0001756397,0.9834273,0.0004098437,0.00002990412,0.0001285673,0.0000998809,0.0003587165,0.003168524],"genre_scores_gemma":[0.1290236,0.0002466513,0.8672078,0.0003035275,0.00006643445,0.0003559721,0.0004811749,0.0003819056,0.001932978],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007733529,"threshold_uncertainty_score":0.04089928,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03486259221766811,"score_gpt":0.2661912026807494,"score_spread":0.2313286104630813,"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."}}