{"id":"W2989754355","doi":"10.24963/ijcai.2019/159","title":"Stochastic Constraint Propagation for Mining Probabilistic Networks","year":2019,"lang":"en","type":"article","venue":"","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"Institut de Valorisation des Données; Canada First Research Excellence Fund; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Probabilistic logic; Constraint programming; Constraint (computer-aided design); Mathematical optimization; Local consistency; Computer science; Propagator; Constraint satisfaction; Binary decision diagram; Constraint logic programming; Decomposition method (queueing theory); Constraint satisfaction problem; Binary constraint; Theoretical computer science; Stochastic programming; Mathematics; Discrete mathematics; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.0002284817,0.00008329692,0.0000989106,0.00002945156,0.00004899532,0.0001113752,0.0002753994,0.00004571903,0.00001620937],"category_scores_gemma":[0.00004954266,0.00006961783,0.00003214854,0.0001037013,0.00002421574,0.0001637854,0.0000485907,0.00005652963,0.00002931572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000202493,"about_ca_system_score_gemma":0.00007549081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002761116,"about_ca_topic_score_gemma":0.000001884555,"domain_scores_codex":[0.9992502,0.00001596958,0.0001532604,0.0002773423,0.00009636927,0.0002068724],"domain_scores_gemma":[0.9994084,0.0001425436,0.00004740052,0.0002450817,0.0001037258,0.00005288426],"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.000006397701,0.0000283419,0.00004404929,0.00003043351,0.000007819842,4.143565e-7,0.0002093632,0.201703,0.0001999812,0.7391074,0.0003014192,0.05836134],"study_design_scores_gemma":[0.0001684764,0.0001064076,0.00004243298,0.00002970307,0.00000289579,0.000005473596,0.00001915723,0.9897209,0.00003355819,0.009737357,0.00002443845,0.0001092102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006935025,0.00001118292,0.9902993,0.0003255519,0.0002836964,0.0004745278,5.210587e-7,0.0001605843,0.001509558],"genre_scores_gemma":[0.9038776,2.143616e-7,0.09546817,0.0002100153,0.00003591441,0.00004402599,0.000002377605,0.000004691447,0.0003569434],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8969426,"threshold_uncertainty_score":0.2838933,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02354860946469923,"score_gpt":0.2479518470998316,"score_spread":0.2244032376351324,"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."}}