{"id":"W109111233","doi":"10.1007/978-3-642-33558-7_65","title":"A Pseudo-Boolean Set Covering Machine","year":2012,"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é Laval","funders":"","keywords":"Computer science; Greedy algorithm; Conjunction (astronomy); Boolean function; Set (abstract data type); Constraint (computer-aided design); Minification; Theoretical computer science; Boolean data type; True quantified Boolean formula; Upper and lower bounds; Algorithm; Mathematical optimization; Mathematics; 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.0006004159,0.0004334791,0.0003723402,0.0006893706,0.0002363795,0.0004650206,0.001665495,0.0002418755,0.000158724],"category_scores_gemma":[0.00004932761,0.0004187481,0.000112219,0.0004511189,0.0003667269,0.0008749545,0.0009172528,0.0006664711,0.0001156651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002845697,"about_ca_system_score_gemma":0.0003152444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002294349,"about_ca_topic_score_gemma":0.00008791122,"domain_scores_codex":[0.9972378,0.00002654533,0.0004181868,0.0009952972,0.0007385648,0.0005836094],"domain_scores_gemma":[0.9981877,0.0002064757,0.0002407354,0.001012241,0.0001346948,0.0002181202],"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.000002603052,0.00001096945,0.0002477377,0.00001914709,0.000008008938,0.00002479268,0.0006003528,0.03536144,0.00006929981,0.02040445,0.00001788723,0.9432333],"study_design_scores_gemma":[0.0003112802,0.0000735491,0.0005535287,0.0002121933,0.000009774792,0.0002151904,1.372616e-7,0.9648989,0.0004862365,0.02780965,0.004623387,0.0008061711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003436254,0.0003466361,0.9916338,0.0005924851,0.001831802,0.0002560494,0.000008607195,0.0002332176,0.005063063],"genre_scores_gemma":[0.2869134,0.0001613488,0.7089894,0.002454575,0.0006524221,0.000008179689,0.00001834928,0.00005315498,0.0007492015],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9424272,"threshold_uncertainty_score":0.9998264,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01579781902115244,"score_gpt":0.238043098737966,"score_spread":0.2222452797168136,"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."}}