{"id":"W139194355","doi":"10.1007/978-3-642-23786-7_19","title":"Solving MAXSAT by Solving a Sequence of Simpler SAT Instances","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":139,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Maximum satisfiability problem; Sequence (biology); Computer science; Conjunctive normal form; Boolean satisfiability problem; Generalization; Satisfiability; Algorithm; Set (abstract data type); Mathematical optimization; Theoretical computer science; Mathematics; Boolean function; Programming language","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.0006101414,0.0004530859,0.0005092592,0.0006468619,0.0002248028,0.0002924204,0.002128666,0.0002745111,0.0001180659],"category_scores_gemma":[0.00009632752,0.0004352596,0.0001243637,0.000572926,0.0008800391,0.001073968,0.0007936121,0.0005500386,0.0000205634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002366295,"about_ca_system_score_gemma":0.0005606828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005989789,"about_ca_topic_score_gemma":0.0001689082,"domain_scores_codex":[0.9967443,0.00003503223,0.0006584238,0.00119993,0.000815529,0.0005468223],"domain_scores_gemma":[0.9977391,0.0003166416,0.0005245652,0.0009705229,0.0003001165,0.0001491041],"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.000005401781,0.0000209079,0.000410355,0.00005976844,0.00001488747,0.00002585927,0.00181311,0.008946307,0.001760682,0.01936282,0.00006629613,0.9675136],"study_design_scores_gemma":[0.0006686467,0.0003229054,0.0004819916,0.001462186,0.00002533934,0.0001809896,0.000002018674,0.8016391,0.009155203,0.1803754,0.00369457,0.001991661],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001180041,0.0004496698,0.9918857,0.0002525898,0.001145381,0.0002742187,0.00001558246,0.000139372,0.005719459],"genre_scores_gemma":[0.5275186,0.000231855,0.4707845,0.000952346,0.0001339679,0.000006712884,0.00001264739,0.00003623388,0.0003230766],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9655219,"threshold_uncertainty_score":0.9998099,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02642937924592157,"score_gpt":0.2449300714418118,"score_spread":0.2185006921958902,"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."}}