{"id":"W2007316622","doi":"10.1145/1714450.1714452","title":"Formula Caching in DPLL","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Division of Mathematical Sciences; National Science Foundation","keywords":"DPLL algorithm; Satisfiability; Mathematical proof; Resolution (logic); Computer science; Tree (set theory); Simple (philosophy); Algorithm; Mathematics; Conjunctive normal form; Boolean satisfiability problem; Discrete mathematics; Theoretical computer science; Combinatorics","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.00113519,0.0001148053,0.0001027677,0.0003226393,0.0001744828,0.00008431303,0.0007109698,0.00008672941,0.0000380625],"category_scores_gemma":[0.0001100765,0.0001187633,0.00005601191,0.000483204,0.00004461453,0.0007183085,0.000008858041,0.0004958819,0.0001332604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000043565,"about_ca_system_score_gemma":0.00003869354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001352497,"about_ca_topic_score_gemma":0.00002886668,"domain_scores_codex":[0.9988635,0.0002240725,0.0002600611,0.0002762862,0.0001906036,0.0001854971],"domain_scores_gemma":[0.9987195,0.0005072736,0.00007626812,0.0005849377,0.00005485753,0.00005718308],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002373404,0.0001371123,0.00002297682,0.000008560544,0.000007570937,0.000002491614,0.001568717,0.0460907,0.002212618,0.3179201,0.000008642869,0.6319968],"study_design_scores_gemma":[0.0006619337,0.00008045595,0.003788924,0.00002249172,0.000007019355,0.00003492052,0.00008767182,0.4677362,0.01491933,0.5116869,0.0006712209,0.0003028696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05752783,0.00000476579,0.9396212,0.0002946956,0.0009773024,0.0001584397,0.000001552609,0.0002060069,0.001208254],"genre_scores_gemma":[0.5644622,0.000001949345,0.4352264,0.000169869,0.00001486288,0.00001947719,0.000001373576,0.000006959614,0.00009692495],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6316939,"threshold_uncertainty_score":0.4843029,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01995854238267281,"score_gpt":0.3078544586707602,"score_spread":0.2878959162880874,"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."}}