{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001100246,0.001636488,0.001959432,0.001039206,0.001025363,0.00204143,0.003085937,0.001442641,0.03946724],"category_scores_gemma":[0.004817985,0.00143687,0.003025649,0.00192917,0.0007601271,0.003864408,0.002047134,0.004916254,0.008091441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001133105,"about_ca_system_score_gemma":0.002028082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002736049,"about_ca_topic_score_gemma":0.006646894,"domain_scores_codex":[0.998731,0.0003078426,0.00009874548,0.0003448889,0.0003747111,0.0001429364],"domain_scores_gemma":[0.9976729,0.001311358,0.0001182364,0.0005181599,0.0003000713,0.00007928284],"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.001091032,0.001468409,0.001310665,0.002536638,0.0003619074,0.0007864729,0.0004325605,0.2061741,0.03649214,0.1231704,0.05985454,0.566321],"study_design_scores_gemma":[0.0005020213,0.0006389582,0.001277537,0.0001683677,0.0003321898,0.0008299965,0.0003338617,0.6274474,0.01816413,0.2796107,0.07056738,0.0001274263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03944299,0.0007653118,0.892188,0.001554595,0.0008695398,0.001517475,0.001440371,0.004453307,0.05776853],"genre_scores_gemma":[0.05998385,0.0004044994,0.9194731,0.0005174899,0.0002555047,0.0005228644,0.002258503,0.0006937313,0.01589045],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03946724,"threshold_uncertainty_score":0.1320311,"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."}}