{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002785143,0.001307557,0.001693049,0.002219221,0.001716044,0.004512296,0.005025213,0.00185922,0.01800322],"category_scores_gemma":[0.01578046,0.001385165,0.002381593,0.003952143,0.002584347,0.01141091,0.006316786,0.007465737,0.002967934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002888635,"about_ca_system_score_gemma":0.002153246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009577272,"about_ca_topic_score_gemma":0.001715282,"domain_scores_codex":[0.9964987,0.0008832256,0.0002663466,0.0004872892,0.001528126,0.0003363101],"domain_scores_gemma":[0.9903223,0.00676066,0.0002562453,0.001938334,0.0005487523,0.0001736961],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002283877,0.0001307627,0.0002629295,0.0003380218,0.00004849997,0.00004211026,0.0003987996,0.01865224,0.001736383,0.8030853,0.004549524,0.170527],"study_design_scores_gemma":[0.00004791441,0.00002632172,0.00005932359,0.00006907418,0.00003378409,0.0000306404,0.00005009831,0.09154819,0.002166618,0.9019306,0.004022483,0.00001482811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01524611,0.0004815296,0.9661171,0.0004788634,0.0001186258,0.0001369849,0.0002401496,0.001686815,0.01549388],"genre_scores_gemma":[0.277564,0.0007791658,0.7014554,0.0002355253,0.0002053824,0.0005469218,0.001395113,0.001160297,0.01665814],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01800322,"threshold_uncertainty_score":0.0602268,"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."}}