{"id":"W2018678448","doi":"10.1109/fmcad.2013.6679404","title":"Efficient modular SAT solving for IC3","year":2013,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Western Canada Research Grid","keywords":"Computer science; Solver; Modular design; Modulo; Satisfiability modulo theories; Boolean satisfiability problem; Sequence (biology); Parallel computing; Algorithm; Theoretical computer science; Programming language; Mathematics; Discrete mathematics","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.0003369086,0.00005992733,0.00006225485,0.00004279454,0.00008129953,0.0001174851,0.0004772373,0.00003036969,0.00003455036],"category_scores_gemma":[0.0001054618,0.00004929622,0.00003720473,0.000124323,0.0000157484,0.0001932646,0.0001061889,0.00003394653,0.0002699372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002697735,"about_ca_system_score_gemma":0.00001321049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001871486,"about_ca_topic_score_gemma":3.498275e-7,"domain_scores_codex":[0.9993405,0.00002398173,0.0001264758,0.0002019914,0.0001205102,0.0001865672],"domain_scores_gemma":[0.9993349,0.00005835163,0.00003717815,0.0004309505,0.00009142993,0.00004718022],"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.00000133524,0.00005314085,0.00007820995,0.00002323001,0.000007384878,2.006355e-7,0.0004529963,0.007461474,0.02367051,0.8118325,0.00163327,0.1547857],"study_design_scores_gemma":[0.00007901334,0.0000266832,0.001971903,0.000003109342,9.483424e-7,0.000001484906,0.00001288273,0.9796032,0.01199477,0.004857644,0.001372756,0.00007554282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03582159,0.00002296526,0.9597049,0.0003208545,0.0003654583,0.000334371,2.139127e-7,0.0001570586,0.003272604],"genre_scores_gemma":[0.2777677,3.344029e-7,0.7215231,0.000180088,0.00002502326,0.00006492749,3.84002e-7,0.000003489387,0.0004348942],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9721418,"threshold_uncertainty_score":0.3469586,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02590236693379281,"score_gpt":0.27647829920258,"score_spread":0.2505759322687872,"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."}}