{"id":"W2810353660","doi":"10.1007/978-3-319-94205-6_10","title":"Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Maximum satisfiability problem; Satisfiability modulo theories; Satisfiability; Computer science; Conjunctive normal form; Modulo; Propositional formula; Solver; Propositional calculus; Set (abstract data type); Boolean satisfiability problem; Theoretical computer science; Answer set programming; Algorithm; Propositional variable; Programming language; Mathematics; Discrete mathematics; Boolean function","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.005067068,0.0006344986,0.0006520544,0.0005562865,0.0005236304,0.0007052211,0.004491869,0.0004527842,0.0000286032],"category_scores_gemma":[0.0008746713,0.0005807918,0.0002000429,0.0006225887,0.0014322,0.001025733,0.001607372,0.0006408887,0.00003490599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004579479,"about_ca_system_score_gemma":0.0004813946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002035265,"about_ca_topic_score_gemma":0.00002207187,"domain_scores_codex":[0.9950312,0.0001126981,0.0008194034,0.002178711,0.0009346787,0.0009232899],"domain_scores_gemma":[0.9948598,0.001259896,0.0005334848,0.002521993,0.0006447864,0.0001800258],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009439727,0.00001474661,0.00003721158,0.00007944919,0.00001081861,0.000003753082,0.001507571,0.002084611,0.0001306985,0.1317077,0.00002700961,0.864387],"study_design_scores_gemma":[0.0001259943,0.0001742675,0.00009440879,0.0001057418,0.000005504027,0.00002506959,3.61306e-7,0.4312934,0.002603677,0.564101,0.00104159,0.0004289594],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001319485,0.0001282048,0.9931666,0.0003728429,0.003483101,0.001006321,0.00003591635,0.0002847807,0.001390234],"genre_scores_gemma":[0.01178787,0.0000102096,0.9862899,0.0007332135,0.0009182579,0.00005440874,0.00001006902,0.00004444798,0.000151678],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8639581,"threshold_uncertainty_score":0.9996644,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0335173284289863,"score_gpt":0.3090077672427075,"score_spread":0.2754904388137212,"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."}}