{"id":"W2262254779","doi":"","title":"Modeling, Global Constraints, and Decomposition","year":2013,"lang":"en","type":"article","venue":"Symposium on Abstraction, Reformulation and Approximation","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint programming; Computer science; Constraint (computer-aided design); Mathematical optimization; Decomposition; Constraint satisfaction problem; Solver; Theoretical computer science; Local consistency; Concurrent constraint logic programming; Combinatorial optimization; Constraint logic programming; Constraint satisfaction; Mathematics; Artificial intelligence; Algorithm; Programming language; 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.002876958,0.001151544,0.0009054241,0.001204208,0.0008718997,0.004486977,0.002037553,0.001457164,0.006195673],"category_scores_gemma":[0.005759105,0.0008545426,0.001602342,0.002527748,0.004183811,0.007993332,0.003947875,0.004573026,0.001074699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001844628,"about_ca_system_score_gemma":0.002015329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004140526,"about_ca_topic_score_gemma":0.004245706,"domain_scores_codex":[0.9965504,0.001495084,0.0002086672,0.0007062628,0.0007355564,0.0003040436],"domain_scores_gemma":[0.9978739,0.0008558648,0.0001585617,0.00076283,0.0002391089,0.0001097465],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000125774,0.000009882307,0.0001156221,0.00009853619,0.00001711592,0.00004101172,0.0001675473,0.02282916,0.0003879849,0.9550521,0.002271986,0.01899643],"study_design_scores_gemma":[0.000007398307,0.000009324648,0.00006185619,0.00006996195,0.00001864568,0.0000452733,0.00008073587,0.05199279,0.0006481299,0.9245219,0.02253255,0.0000113889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003162497,0.001238294,0.9782728,0.001398292,0.00007860266,0.00005328082,0.000213619,0.0003064112,0.01527618],"genre_scores_gemma":[0.1919923,0.004039382,0.790016,0.000889926,0.000341495,0.0004560449,0.00115309,0.0005423621,0.01056941],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006195673,"threshold_uncertainty_score":0.02072656,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009107650882841841,"score_gpt":0.2477117496452006,"score_spread":0.2386040987623588,"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."}}