{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007212967,0.00005577398,0.00005413971,0.00005170947,0.00009628687,0.000109837,0.00007900406,0.00002357074,0.0004924597],"category_scores_gemma":[0.000006347844,0.00005332518,0.00001538516,0.00006481123,0.00009372969,0.0004520415,0.00004546122,0.00004581801,0.00004825479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001449617,"about_ca_system_score_gemma":0.00002794389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004380813,"about_ca_topic_score_gemma":0.00001574108,"domain_scores_codex":[0.999542,0.00001464729,0.0001066275,0.0001456407,0.00009975363,0.00009130563],"domain_scores_gemma":[0.9997557,0.00003686473,0.00002866704,0.00008131935,0.00003407374,0.00006336878],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002087273,0.00003368044,0.02998285,0.000004213032,0.00001547135,0.000005246678,0.0002282885,0.001233434,0.001031364,0.6485504,0.002067219,0.3168457],"study_design_scores_gemma":[0.001374194,0.00004309773,0.1383291,0.00001810683,0.000006416829,0.0004509818,0.00007837913,0.8372419,0.00216114,0.005202454,0.01464189,0.0004522715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006885706,0.00001389595,0.9716259,0.003448804,0.00005870452,0.00005281246,0.000002347722,0.0001396773,0.01777211],"genre_scores_gemma":[0.8183398,0.000003489544,0.1804756,0.0009544787,0.00002598517,0.000001364205,0.000006274402,0.000001554205,0.000191483],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8360085,"threshold_uncertainty_score":0.5392088,"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."}}