{"id":"W3176021534","doi":"10.1609/aaai.v35i14.17474","title":"Learning Branching Heuristics for Propositional Model Counting","year":2021,"lang":"en","type":"article","venue":"","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Vector Institute; University of Toronto","funders":"Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Heuristics; Boolean satisfiability problem; Computer science; Propositional formula; Scalability; Solver; Probabilistic logic; Theoretical computer science; Counting problem; Overhead (engineering); Maximum satisfiability problem; Satisfiability; True quantified Boolean formula; Branching (polymer chemistry); Algorithm; Mathematics; Propositional variable; Artificial intelligence; Boolean function; Programming language; Intermediate logic","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.0001935854,0.00007099473,0.00008118181,0.00002098586,0.0002361864,0.000234904,0.0001990864,0.00003577243,0.000006609945],"category_scores_gemma":[0.0001394405,0.00006994035,0.00004304827,0.0001013293,0.00001092958,0.0002276424,0.00009553691,0.000129331,0.000008621634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001602394,"about_ca_system_score_gemma":0.0001811278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002561145,"about_ca_topic_score_gemma":0.000001520633,"domain_scores_codex":[0.999254,0.00001952312,0.0001353041,0.0002540388,0.0001509697,0.0001861038],"domain_scores_gemma":[0.9994288,0.0001098964,0.00003465406,0.0001397758,0.0002422581,0.00004459999],"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.000001804601,0.00003048591,0.00006729769,0.00002353262,0.000007773066,0.000004749872,0.0002632178,0.1797802,0.004142626,0.7988229,0.0004400533,0.01641527],"study_design_scores_gemma":[0.00009762189,0.0000166259,0.000009936163,0.00002437381,0.000002769766,0.00001390934,0.0000138275,0.9425313,0.002141322,0.05489291,0.0001559068,0.00009947639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002915491,0.00003711526,0.9916676,0.0007422734,0.00009219301,0.00004364003,0.000001430327,0.0001657654,0.004334524],"genre_scores_gemma":[0.5470824,0.000002800835,0.4513828,0.0003650481,0.00004014952,0.000005894267,0.000005949521,0.000004280218,0.001110715],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7627511,"threshold_uncertainty_score":0.2852085,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02506010837299026,"score_gpt":0.2674832899943436,"score_spread":0.2424231816213534,"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."}}