{"id":"W2814827538","doi":"10.24963/ijcai.2018/723","title":"Reduced Cost Fixing for Maximum Satisfiability","year":2018,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Helsingin Yliopisto","keywords":"Maximum satisfiability problem; Boolean satisfiability problem; Satisfiability; Solver; Computer science; Integer programming; Set (abstract data type); Mathematical optimization; Theoretical computer science; Algorithm; Mathematics; Boolean function; Programming language","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.002728,0.001312748,0.0009584104,0.001623174,0.00104377,0.00200249,0.00293899,0.001310447,0.01441587],"category_scores_gemma":[0.02056974,0.0007520459,0.001941919,0.001499407,0.002314947,0.004033871,0.002873476,0.004949099,0.001729211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002405346,"about_ca_system_score_gemma":0.002043641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001951575,"about_ca_topic_score_gemma":0.002775253,"domain_scores_codex":[0.9956086,0.001464379,0.0001666989,0.0005765624,0.001711125,0.0004725916],"domain_scores_gemma":[0.9904354,0.00660265,0.0004853665,0.001645926,0.0006480969,0.0001826029],"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.0001863265,0.0001366091,0.0007180277,0.0006047357,0.0001010001,0.0002216687,0.0003015194,0.1785674,0.006859356,0.6736135,0.01230037,0.1263894],"study_design_scores_gemma":[0.00006999246,0.0001447816,0.0003038006,0.0001996912,0.0000865849,0.0001937266,0.00008087072,0.4445041,0.008662719,0.5237946,0.02190334,0.00005567177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03014257,0.001072823,0.9316199,0.001372053,0.000268764,0.0001698015,0.0002832445,0.001961542,0.03310926],"genre_scores_gemma":[0.4408426,0.00110569,0.5434531,0.0007915301,0.0002964774,0.0005224594,0.0009486882,0.001572206,0.01046724],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01441587,"threshold_uncertainty_score":0.04822588,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05785960665417542,"score_gpt":0.3490497924107515,"score_spread":0.2911901857565761,"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."}}