{"id":"W2164902897","doi":"10.1109/ictai.2004.109","title":"Solving conditional and composite temporal constraints","year":2005,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint (computer-aided design); Constraint satisfaction dual problem; Constraint satisfaction; Constraint satisfaction problem; Local consistency; Computer science; Mathematical optimization; Variable (mathematics); Constraint graph; Set (abstract data type); Constraint programming; Constraint learning; Constraint logic programming; Mathematics; 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.002090709,0.0009130269,0.0008037274,0.0007947353,0.0007550853,0.00136792,0.001390523,0.001031307,0.005974831],"category_scores_gemma":[0.009050182,0.0005727187,0.001160196,0.001677847,0.0009440486,0.001982099,0.001907246,0.001667693,0.0004094871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006294273,"about_ca_system_score_gemma":0.002307945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005307541,"about_ca_topic_score_gemma":0.007948463,"domain_scores_codex":[0.9980758,0.0005943489,0.0001193504,0.000345204,0.0006680189,0.0001971638],"domain_scores_gemma":[0.9925505,0.005814438,0.0004388087,0.0004678558,0.0005851438,0.0001432332],"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.000238076,0.0001829925,0.00238909,0.0007244601,0.0001343949,0.000739467,0.0003527196,0.6941098,0.01195853,0.1040755,0.006890142,0.1782048],"study_design_scores_gemma":[0.00003472077,0.00004195472,0.0003549691,0.00002207774,0.0000303146,0.0001617306,0.00009286772,0.9530025,0.007143544,0.03402749,0.005069813,0.00001800701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03046193,0.0001162148,0.96474,0.000209366,0.00003604213,0.0001106026,0.0002802472,0.0006013155,0.003444372],"genre_scores_gemma":[0.2234714,0.0001807949,0.77215,0.00009832886,0.0000385467,0.0002130698,0.0007076613,0.0001903403,0.002949853],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005974831,"threshold_uncertainty_score":0.01998782,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009649338070301376,"score_gpt":0.2291088224908181,"score_spread":0.2194594844205167,"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."}}