{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000284633,0.0003621142,0.000646641,0.0004447213,0.00067021,0.001118544,0.001019795,0.0009919141,0.01069315],"category_scores_gemma":[0.001494903,0.0002779525,0.0006808488,0.000951945,0.0006931951,0.001495489,0.001006362,0.0007812101,0.001623411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000784186,"about_ca_system_score_gemma":0.0007297603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008270098,"about_ca_topic_score_gemma":0.001274407,"domain_scores_codex":[0.9996371,0.00008655197,0.00001884722,0.00009103125,0.0001149144,0.00005153675],"domain_scores_gemma":[0.9995223,0.0002533103,0.00002232729,0.0001046155,0.00005260084,0.00004498759],"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.0003341573,0.0001635069,0.000641217,0.000565605,0.00006770402,0.0003478286,0.0002662974,0.1205119,0.01895783,0.3516166,0.03879819,0.4677292],"study_design_scores_gemma":[0.00006445158,0.0001400183,0.0005911086,0.00006965277,0.00004654341,0.000384965,0.00005159929,0.6056781,0.00831731,0.3486305,0.03598896,0.00003683663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06878266,0.001022218,0.8719894,0.002263875,0.0005695321,0.0002118705,0.001710138,0.006024026,0.04742628],"genre_scores_gemma":[0.4720026,0.0005879302,0.5021251,0.0004508415,0.0002127247,0.0003159698,0.001970807,0.0005177446,0.02181621],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01069315,"threshold_uncertainty_score":0.0357722,"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."}}