{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000192041,0.0001471671,0.0002087623,0.0001754444,0.0001095599,0.00008702539,0.0003775268,0.00008283054,0.0002375112],"category_scores_gemma":[0.0001236576,0.000162077,0.0001115197,0.0002809326,0.0002894623,0.0004312824,0.00003633352,0.00009024271,0.00000885167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003308821,"about_ca_system_score_gemma":0.0002198264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005545341,"about_ca_topic_score_gemma":0.000004168684,"domain_scores_codex":[0.9988598,0.00002636745,0.0003742615,0.0003038513,0.0001845465,0.0002512239],"domain_scores_gemma":[0.9990409,0.000128557,0.0001770516,0.0003097135,0.0001816853,0.0001620773],"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.000002232182,0.00005542903,0.0003540208,0.000006008179,0.00001591122,0.000002381952,0.0002554457,0.0001590585,0.0008036565,0.1659329,0.0005942628,0.8318187],"study_design_scores_gemma":[0.02195589,0.001516625,0.2749712,0.000703047,0.0001459703,0.0004381685,0.0009347253,0.5030164,0.04117966,0.1473917,0.004946965,0.002799656],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002040245,0.00001628283,0.988143,0.0007981762,0.000375812,0.0003778177,0.00002282293,0.0001557763,0.008070073],"genre_scores_gemma":[0.7380729,0.000004785927,0.2615688,0.0001409323,0.00002891747,0.000006219623,0.00001078153,0.000004832079,0.0001618564],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.829019,"threshold_uncertainty_score":0.6609308,"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."}}