{"id":"W986923873","doi":"10.1007/978-3-319-21668-3_5","title":"Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Satisfiability; Set (abstract data type); Combinatorics; Intersection (aeronautics); Duality (order theory); Discrete mathematics; Computer science; Computation; Algorithm; Mathematics","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.002593881,0.0008594912,0.000839571,0.001594761,0.0004576177,0.000847398,0.004136565,0.0005389605,0.00001757245],"category_scores_gemma":[0.00035767,0.0008768624,0.0001648692,0.00181062,0.0006884664,0.001113539,0.002227696,0.001028292,0.0001196712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001271799,"about_ca_system_score_gemma":0.001247602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007896477,"about_ca_topic_score_gemma":0.0000421681,"domain_scores_codex":[0.9932123,0.0001367607,0.000965856,0.002444603,0.002070003,0.001170525],"domain_scores_gemma":[0.9955736,0.0003997466,0.0005776159,0.002070594,0.0008321663,0.0005462379],"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.00003437543,0.00006077057,0.00006286142,0.00004817073,0.00001601416,0.00007295762,0.002351713,0.4729304,0.0004020703,0.003807494,0.0004560406,0.5197571],"study_design_scores_gemma":[0.0003126023,0.0004137663,0.0002586197,0.0004491337,0.00001603037,0.0002786343,0.000001168835,0.9869245,0.001699475,0.006655064,0.002016916,0.0009740869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001780427,0.0002193558,0.9845206,0.000305825,0.01004283,0.0008988411,0.00001526372,0.0003286794,0.001888171],"genre_scores_gemma":[0.02553014,0.000004556419,0.9726693,0.001036045,0.000420201,0.00001323422,0.00001139426,0.00006485009,0.0002502687],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.518783,"threshold_uncertainty_score":0.9993682,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06497413392949586,"score_gpt":0.333500299153706,"score_spread":0.2685261652242101,"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."}}