{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001403793,0.0001271025,0.0001543275,0.0001799073,0.0008623604,0.0005324797,0.0001996614,0.00005522787,0.000006050014],"category_scores_gemma":[0.0002815329,0.0001082208,0.00006823246,0.0001461119,0.0001084496,0.0007701955,0.0001365361,0.000238777,0.00000898658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001118237,"about_ca_system_score_gemma":0.0002057238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001971666,"about_ca_topic_score_gemma":0.000001928114,"domain_scores_codex":[0.9987882,0.00003148138,0.0004108186,0.0001636687,0.0002599263,0.0003458844],"domain_scores_gemma":[0.9988502,0.0002382201,0.0002929169,0.0001229739,0.0002672955,0.0002284552],"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.00002477993,0.00003544652,0.005494489,0.00002112629,0.00004053788,0.00001455569,0.002768937,0.01357377,0.0001410812,0.1861718,0.0008376354,0.7908759],"study_design_scores_gemma":[0.004415497,0.0005451841,0.00868653,0.0004671015,0.00002192302,0.003167461,0.003238103,0.9580966,0.00004716335,0.00867769,0.01195316,0.0006835844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06544194,0.00005654915,0.9292251,0.001223653,0.0007486031,0.0001498536,0.00000177064,0.00008125414,0.003071298],"genre_scores_gemma":[0.8637197,0.00001105904,0.1355295,0.0005788559,0.0001370926,0.000001022385,0.000001863675,0.000006162996,0.00001476148],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9445228,"threshold_uncertainty_score":0.6632666,"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."}}