{"id":"W4283209583","doi":"10.1145/3500921","title":"When satisfiability solving meets symbolic computation","year":2022,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; Wilfrid Laurier University; University of Windsor","funders":"","keywords":"Computer science; Symbolic computation; Computation; Satisfiability; Brute force; Theoretical computer science; Algorithm; Mathematics; Computer security","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":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001491544,0.00006890064,0.0001093351,0.00006739101,0.0008104297,0.00003529481,0.04046139,0.00002002126,0.00001018146],"category_scores_gemma":[0.004389151,0.00006283389,0.00007340542,0.0005037028,0.0001705506,0.0002723513,0.04945249,0.000245419,0.000005391732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001186632,"about_ca_system_score_gemma":0.00007764559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007559318,"about_ca_topic_score_gemma":0.000008430336,"domain_scores_codex":[0.9980626,0.001058882,0.000310405,0.0001693383,0.0002846708,0.0001141218],"domain_scores_gemma":[0.9700102,0.0004820427,0.0002781026,0.02909446,0.00011133,0.00002388911],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005779985,0.0003712643,0.006056105,0.00003475943,0.00004062115,8.667277e-8,0.009901027,0.006174664,0.004648729,0.9003435,0.01661786,0.05580557],"study_design_scores_gemma":[0.0001935353,0.00004316709,0.04539857,0.00001575454,0.00001495023,0.00001153578,0.000292077,0.2270423,0.002329145,0.7126314,0.01186583,0.0001617075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1792396,0.003289314,0.4449319,0.3372134,0.002728686,0.002810232,0.00006359055,0.0008966373,0.02882662],"genre_scores_gemma":[0.4806173,0.000008513111,0.5191965,0.0001020596,0.000003443153,0.0000484388,0.000002880661,0.000003413835,0.00001747366],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3371114,"threshold_uncertainty_score":0.9647301,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07326705349603489,"score_gpt":0.3332004790898047,"score_spread":0.2599334255937698,"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."}}