{"id":"W2250281898","doi":"","title":"Finding the most probable solution to a probabilistic temporal interval algebra network","year":2006,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Acadia University","funders":"","keywords":"Probabilistic logic; Implementation; Computer science; Theoretical computer science; Constraint satisfaction problem; Constraint programming; Domain (mathematical analysis); Constraint (computer-aided design); Constraint logic programming; Constraint satisfaction; Interval (graph theory); Binary number; Simplicity; Programming language; Algorithm; Mathematical optimization; Mathematics; Arithmetic; 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.001686757,0.0005827659,0.0007431489,0.001192969,0.000773717,0.001426486,0.001648879,0.001324415,0.009605686],"category_scores_gemma":[0.008674863,0.0005385738,0.001328118,0.00158818,0.0009444059,0.003461499,0.001266265,0.001299246,0.0008600094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001087638,"about_ca_system_score_gemma":0.001732558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003274939,"about_ca_topic_score_gemma":0.004286012,"domain_scores_codex":[0.9989641,0.0003186461,0.00007410273,0.0003115524,0.0002157237,0.0001160257],"domain_scores_gemma":[0.9976556,0.001653993,0.0001978044,0.0001710915,0.0002472534,0.00007421897],"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.0001874233,0.00007657978,0.001875108,0.0003625446,0.00009582932,0.0002249273,0.0003068653,0.6807577,0.00390691,0.1978499,0.003448956,0.1109072],"study_design_scores_gemma":[0.00002642393,0.00002215141,0.0001557117,0.0000176461,0.00002323419,0.0001004299,0.0001064994,0.870298,0.002520223,0.1232909,0.003422349,0.00001646434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009658892,0.00007133691,0.9866809,0.0002282126,0.00001270247,0.00004451315,0.0001863631,0.0003390203,0.002778154],"genre_scores_gemma":[0.1756704,0.0002169915,0.8206184,0.0001097681,0.00002818883,0.0002077742,0.0005758926,0.000140742,0.00243183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009605686,"threshold_uncertainty_score":0.03213418,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01517741712374708,"score_gpt":0.2288040644606515,"score_spread":0.2136266473369044,"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."}}