{"id":"W3103675051","doi":"10.1007/978-3-030-63461-2_21","title":"Reformulation of SAT into a Polynomial Box-Constrained Optimization Problem","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Leverage (statistics); Solver; Computer science; Mathematical optimization; Boolean data type; Polynomial; Boolean satisfiability problem; True quantified Boolean formula; Optimization problem; Constraint (computer-aided design); Constrained optimization problem; Function (biology); Mathematics; Applied mathematics; Algorithm; Theoretical computer science","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.000402952,0.0003784286,0.00045195,0.0007489803,0.0001680145,0.0002480492,0.001158345,0.000291639,0.00004779225],"category_scores_gemma":[0.00008366378,0.0003675364,0.000121284,0.0007383752,0.0004977116,0.0008335256,0.0005024737,0.0004270093,0.00001307115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003077696,"about_ca_system_score_gemma":0.0007678351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002494855,"about_ca_topic_score_gemma":0.00005461707,"domain_scores_codex":[0.9972059,0.00003317555,0.0007240204,0.001010971,0.0007222515,0.0003036897],"domain_scores_gemma":[0.9982198,0.0001492064,0.0005283224,0.0006376042,0.0003143722,0.000150687],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009267489,0.0000101697,0.00004138835,0.00003691901,0.00000784229,0.000006511158,0.0006933977,0.6144862,0.0002079369,0.01012312,0.000006249726,0.374371],"study_design_scores_gemma":[0.0003694686,0.0001449672,0.00006370697,0.000188043,0.000008641453,0.00002602414,3.022288e-7,0.977825,0.0009313853,0.01991543,0.0001428818,0.0003841357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001763026,0.00005081982,0.9935389,0.0015626,0.0006561788,0.0004941223,0.000005367962,0.0001626053,0.003511745],"genre_scores_gemma":[0.1800219,0.00001931721,0.8192377,0.0004542539,0.0001649261,0.000004785075,0.00002637514,0.00002054815,0.00005023354],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3739869,"threshold_uncertainty_score":0.9998776,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01056071434069165,"score_gpt":0.2256587994584573,"score_spread":0.2150980851177656,"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."}}