{"id":"W2094368841","doi":"10.1145/1822327.1822333","title":"Scalable formula decomposition for propositional satisfiability","year":2010,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"DPLL algorithm; Satisfiability; Computer science; Probabilistic logic; Scalability; Boolean satisfiability problem; Propositional formula; Theoretical computer science; Decomposition; Conjunctive normal form; Algorithm; Propositional variable; Artificial intelligence","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.001315787,0.001006547,0.0008486074,0.001302035,0.0006386209,0.001292363,0.001217796,0.0007437919,0.007490823],"category_scores_gemma":[0.006706417,0.0005767384,0.001470599,0.002003331,0.0007655071,0.002159735,0.001871669,0.002275051,0.001728214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001179055,"about_ca_system_score_gemma":0.001837336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002761352,"about_ca_topic_score_gemma":0.005299795,"domain_scores_codex":[0.9985784,0.0003674561,0.0001110837,0.0002223685,0.000541471,0.0001791596],"domain_scores_gemma":[0.9964442,0.002032307,0.0001797166,0.0008753496,0.0003780187,0.00009045701],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003472201,0.0003428207,0.001017187,0.0008010537,0.00009074075,0.000333691,0.0002453765,0.2263158,0.03857091,0.1123438,0.0266414,0.59295],"study_design_scores_gemma":[0.0001673138,0.00008188154,0.0002282309,0.00005905146,0.00004583258,0.0001133149,0.00006661787,0.843431,0.01454198,0.12929,0.01195622,0.00001854568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01687505,0.000584328,0.9675684,0.0004296888,0.00009551235,0.0002264624,0.0006836915,0.00787066,0.005666273],"genre_scores_gemma":[0.1190478,0.0004962534,0.8741619,0.0001942522,0.00006887361,0.0004859836,0.002911078,0.0008140274,0.001819919],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007490823,"threshold_uncertainty_score":0.02505928,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01586873743303921,"score_gpt":0.326603456725126,"score_spread":0.3107347192920867,"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."}}