{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002460522,0.001683992,0.001645102,0.003354218,0.001338565,0.00217484,0.002359164,0.001473362,0.005873346],"category_scores_gemma":[0.01496245,0.001571294,0.002338869,0.002334322,0.001685129,0.003080218,0.001747129,0.002758304,0.0006044881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001825659,"about_ca_system_score_gemma":0.00351849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007764929,"about_ca_topic_score_gemma":0.01700702,"domain_scores_codex":[0.9982474,0.0006960629,0.0001422054,0.0002997392,0.0003308117,0.0002838233],"domain_scores_gemma":[0.9882987,0.009834387,0.0004716779,0.0005603894,0.0006570657,0.0001777581],"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.001440876,0.001277864,0.008487594,0.001353523,0.0004397165,0.0009597827,0.0009799325,0.4325517,0.01554515,0.06354022,0.01316659,0.4602571],"study_design_scores_gemma":[0.000312097,0.0002297729,0.0008544215,0.000175622,0.0002846668,0.0001760318,0.000582113,0.8892115,0.01090407,0.09442185,0.002798204,0.0000496816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.204051,0.0009560402,0.7802666,0.001159279,0.0001600752,0.001048828,0.0009444029,0.002899953,0.00851371],"genre_scores_gemma":[0.2979417,0.0003494256,0.6965139,0.0003909975,0.00004526319,0.0003284867,0.002079788,0.0004165093,0.001933975],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007764929,"threshold_uncertainty_score":0.01964831,"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."}}