{"id":"W2081776044","doi":"10.1007/s10878-008-9142-4","title":"Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Heuristics; Satisfiability; Cardinality (data modeling); Propositional formula; Computer science; Theory of computation; Propositional calculus; Boolean satisfiability problem; Algorithm; Propositional variable; Theoretical computer science; Mathematics; Discrete mathematics; Mathematical optimization","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":[],"consensus_categories":[],"category_scores_codex":[0.001458802,0.0001392225,0.000310226,0.0003436214,0.0001182071,0.00007758382,0.0005454231,0.0001131255,0.000009711253],"category_scores_gemma":[0.001070493,0.0001388478,0.00006284234,0.001014764,0.00004120173,0.001227821,0.00009954872,0.0002378491,0.000002636265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003307803,"about_ca_system_score_gemma":0.0003241441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002967889,"about_ca_topic_score_gemma":6.870942e-7,"domain_scores_codex":[0.9978633,0.0002409878,0.0009189117,0.0001937012,0.0005458771,0.0002372241],"domain_scores_gemma":[0.9982558,0.0001242548,0.0005800134,0.0003144545,0.0005907906,0.0001347005],"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.00005967711,0.0001621704,0.004983586,0.00001815901,0.000007020388,0.00001166538,0.0009867776,0.9760659,0.0005312861,0.0165367,0.00007866364,0.0005583459],"study_design_scores_gemma":[0.001375377,0.0005370699,0.009330694,0.00007574067,0.000009672516,0.000140579,0.00001546482,0.97879,0.00199105,0.007310249,0.0002055859,0.0002184902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1625545,0.00002790275,0.834367,0.00007837979,0.002556363,0.0002330746,8.446687e-7,0.00001694985,0.000164915],"genre_scores_gemma":[0.3309772,0.00001728876,0.6688408,0.00002531497,0.0001209329,0.000002112823,6.158141e-7,0.000008308357,0.000007433528],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1684227,"threshold_uncertainty_score":0.5662051,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05335867939472368,"score_gpt":0.3008953051668395,"score_spread":0.2475366257721159,"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."}}