{"id":"W2137578750","doi":"10.1007/s10601-008-9067-7","title":"New filtering algorithms for combinations of among constraints","year":2009,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Subsequence; Sequence (biology); Consistency (knowledge bases); Constraint (computer-aided design); Algorithm; Constraint programming; Domain (mathematical analysis); Computer science; Longest common subsequence problem; Local consistency; Time complexity; Mathematics; Constraint satisfaction; Mathematical optimization; Artificial intelligence; Stochastic programming","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.004715466,0.002501155,0.002743057,0.005152,0.00167639,0.003642811,0.003456142,0.002770407,0.009980511],"category_scores_gemma":[0.0150491,0.00195481,0.003017978,0.005774654,0.00109931,0.006587212,0.002332099,0.003321541,0.002038473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001626752,"about_ca_system_score_gemma":0.00194705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007170049,"about_ca_topic_score_gemma":0.01362194,"domain_scores_codex":[0.995706,0.0008513884,0.0003761433,0.001012204,0.001771262,0.0002830592],"domain_scores_gemma":[0.990988,0.005636087,0.0004448603,0.001147029,0.00157446,0.0002095454],"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.0002292231,0.0002896349,0.001091881,0.0003500016,0.0002690716,0.0001451562,0.0001601651,0.1311837,0.004989456,0.06605542,0.0168706,0.7783657],"study_design_scores_gemma":[0.00005135255,0.00004551298,0.0002542195,0.00005485203,0.00009886161,0.0001452653,0.00004222941,0.9451876,0.002855242,0.04380121,0.00742674,0.0000370277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001741939,0.0002066233,0.9964436,0.00007241299,0.00007153551,0.00005114909,0.00007653779,0.0003895961,0.0009466383],"genre_scores_gemma":[0.01884186,0.0002483845,0.9773221,0.0001148927,0.0001087772,0.0001090475,0.0004974618,0.0002076761,0.00254972],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009980511,"threshold_uncertainty_score":0.03338808,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02204268813549134,"score_gpt":0.2694888309084734,"score_spread":0.247446142772982,"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."}}