{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006983188,0.00007101504,0.00007086722,0.00004350162,0.0001647531,0.0001023247,0.000387191,0.0000645447,0.00005848415],"category_scores_gemma":[0.0001076007,0.00006229916,0.00004824283,0.0001343726,0.00004198073,0.0008165697,0.00006472521,0.00009742127,0.00003486215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000274479,"about_ca_system_score_gemma":0.00004846295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009599257,"about_ca_topic_score_gemma":0.0000110241,"domain_scores_codex":[0.9992285,0.00002897009,0.0001725674,0.0002511553,0.0001509652,0.0001678507],"domain_scores_gemma":[0.9992042,0.00009715844,0.00005090956,0.0004272042,0.0001617288,0.00005879334],"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.000006520521,0.00005073197,0.0003293605,0.00001230394,0.000002293409,6.147253e-8,0.00003013926,0.00001092032,0.04660745,0.9196782,0.0003777535,0.0328943],"study_design_scores_gemma":[0.0003575147,0.0001365255,0.01996953,0.000004416742,0.000004066262,0.00002417219,0.000003402507,0.5056485,0.2427585,0.2258781,0.005016528,0.0001987649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0412984,0.000001669684,0.9519465,0.0005640416,0.0005276506,0.000419577,0.00000392733,0.0001736135,0.005064639],"genre_scores_gemma":[0.2896682,1.738935e-7,0.7099469,0.0001318629,0.00005015047,0.00008732525,0.000007754928,0.000003217444,0.0001043809],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6938001,"threshold_uncertainty_score":0.2540486,"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."}}