{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0079437,0.0009693663,0.00166114,0.001879012,0.002348176,0.007199467,0.002516538,0.004755997,0.01769919],"category_scores_gemma":[0.0834331,0.00151445,0.001566244,0.001995264,0.009849126,0.02417618,0.007933012,0.00916999,0.002873151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002442999,"about_ca_system_score_gemma":0.003405764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002540792,"about_ca_topic_score_gemma":0.00247226,"domain_scores_codex":[0.984988,0.005371475,0.001178379,0.002780956,0.003984135,0.001696995],"domain_scores_gemma":[0.9574881,0.03160297,0.001241939,0.006573097,0.002235373,0.0008585261],"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.0001103689,0.00006274854,0.00032084,0.0002125059,0.00003891292,0.0001507165,0.0003971793,0.006132587,0.000640529,0.9664606,0.005212092,0.02026086],"study_design_scores_gemma":[0.00002472692,0.00001106344,0.00002740256,0.00003096572,0.0000103457,0.00003642578,0.00006524449,0.01228951,0.0006053695,0.9814408,0.005448988,0.000009144905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03914288,0.004079635,0.7650148,0.03436739,0.00250085,0.0003604393,0.0005836408,0.003166922,0.1507834],"genre_scores_gemma":[0.7084323,0.00267043,0.2519577,0.005833003,0.002349481,0.0007459197,0.001397096,0.00152384,0.02509039],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01769919,"threshold_uncertainty_score":0.05920964,"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."}}