{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007199267,0.0008498921,0.0007715906,0.0004985107,0.0005243936,0.001931065,0.001506344,0.0007525298,0.02323051],"category_scores_gemma":[0.002491871,0.0005052735,0.001365872,0.001180006,0.001139709,0.002706987,0.001576193,0.003101309,0.004895602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001041461,"about_ca_system_score_gemma":0.00193816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0036163,"about_ca_topic_score_gemma":0.005269941,"domain_scores_codex":[0.9992315,0.0002454308,0.00003640226,0.000153578,0.0002422055,0.00009090575],"domain_scores_gemma":[0.9992247,0.0004535631,0.00003455833,0.000134326,0.0001271359,0.00002583227],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001070293,0.0001243605,0.000115001,0.0003603737,0.00004479771,0.0001404829,0.0001316851,0.08532396,0.003885,0.7419577,0.03692018,0.1308895],"study_design_scores_gemma":[0.00009991915,0.00008449837,0.0002017497,0.0001427671,0.00005074959,0.000127702,0.00008584507,0.303249,0.004506532,0.5941111,0.09731261,0.0000275005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004945793,0.0004414249,0.9293309,0.001287831,0.0003701697,0.0001590068,0.0007495729,0.0008270058,0.06188837],"genre_scores_gemma":[0.1693752,0.001759988,0.7605519,0.001160829,0.0006015986,0.0004995721,0.002739851,0.0008755345,0.06243553],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02323051,"threshold_uncertainty_score":0.07771385,"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."}}