{"id":"W1807142225","doi":"10.1007/978-3-540-72788-0_22","title":"Dynamically Partitioning for Solving QBF","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Solver; Computer science; True quantified Boolean formula; Boolean satisfiability problem; Propositional formula; Conjunctive normal form; Propositional calculus; Theoretical computer science; Parallel computing; Algorithm; Programming language; Propositional variable","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002617202,0.0004096604,0.0004028406,0.0007493975,0.0003748461,0.0005571193,0.002998203,0.0003583829,0.00001071795],"category_scores_gemma":[0.0004006256,0.0004102071,0.0001486588,0.0005053093,0.0005333618,0.0008298622,0.0007774298,0.0006325285,0.00002685701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004324545,"about_ca_system_score_gemma":0.0003708726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006016966,"about_ca_topic_score_gemma":0.00003764246,"domain_scores_codex":[0.9964198,0.00002170683,0.0006287268,0.001358196,0.0008007379,0.0007707797],"domain_scores_gemma":[0.9971031,0.0007418873,0.0003585109,0.001261015,0.0003766986,0.0001587955],"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.000006325195,0.00001400771,0.00001454952,0.00004903623,0.000005872871,0.00001118869,0.0003025532,0.01600147,0.0002107495,0.179875,0.000007432257,0.8035018],"study_design_scores_gemma":[0.0001161588,0.0001180491,0.00007741931,0.0002557839,0.000005188427,0.00003082776,7.537952e-8,0.7830429,0.002057219,0.2120846,0.001770439,0.0004413936],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002176236,0.0001950631,0.9930301,0.0002493975,0.002327046,0.0005346161,0.000004104018,0.0002239091,0.00341397],"genre_scores_gemma":[0.008298361,0.00001422875,0.9899911,0.0009722707,0.0004459439,0.00002118387,0.000006635934,0.0000328613,0.0002174227],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8030605,"threshold_uncertainty_score":0.999835,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04062352991424389,"score_gpt":0.3092980261095121,"score_spread":0.2686744961952682,"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."}}