{"id":"W2191686679","doi":"10.1609/aaai.v28i1.8849","title":"Relaxation Search: A Simple Way of Managing Optional Clauses","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Satisfiability; Solver; Relaxation (psychology); Simple (philosophy); Computer science; Maximum satisfiability problem; Heuristic; Boolean satisfiability problem; Set (abstract data type); Task (project management); Flexibility (engineering); Algorithm; Conjunctive normal form; Mathematical optimization; Mathematics; Theoretical computer science; Artificial intelligence; 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.002909221,0.001283436,0.001191553,0.001124974,0.0009195182,0.001853561,0.003318007,0.00142786,0.01429793],"category_scores_gemma":[0.01092762,0.001019895,0.001436251,0.00157199,0.00158458,0.00350341,0.002898187,0.003405751,0.002174659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007840384,"about_ca_system_score_gemma":0.002036464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002181857,"about_ca_topic_score_gemma":0.004096913,"domain_scores_codex":[0.9983005,0.0006761273,0.0001087782,0.0003054627,0.0004245429,0.0001846688],"domain_scores_gemma":[0.9955094,0.002838967,0.0003479521,0.0007654553,0.0004238213,0.0001144701],"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.001074541,0.0005379682,0.002757229,0.00116845,0.0003009583,0.0006492033,0.0009333931,0.219732,0.03201508,0.1808664,0.03455287,0.5254119],"study_design_scores_gemma":[0.0005252843,0.000387169,0.0005427466,0.0001834693,0.0001651314,0.0005452828,0.0002371707,0.7736722,0.0317187,0.1542614,0.03765491,0.0001064938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01364905,0.0003102553,0.9724196,0.0005052713,0.00007849819,0.0002914354,0.0002713095,0.003304459,0.009170146],"genre_scores_gemma":[0.1163742,0.0002072581,0.8765423,0.0004841275,0.00004618383,0.0002994869,0.0006489522,0.0008582217,0.004539243],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01429793,"threshold_uncertainty_score":0.04783136,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1320653948135614,"score_gpt":0.3374809303961208,"score_spread":0.2054155355825593,"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."}}