{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001437486,0.0001417081,0.0001947794,0.0001641605,0.0001434255,0.0001106272,0.001685585,0.00007072368,0.00003528427],"category_scores_gemma":[0.001161939,0.0001125229,0.0000854184,0.0006356756,0.0002671498,0.0005648151,0.0003217034,0.0002190914,0.00004122468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003964831,"about_ca_system_score_gemma":0.00005010748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003389855,"about_ca_topic_score_gemma":0.000002533495,"domain_scores_codex":[0.9982243,0.00004918154,0.0005381762,0.0003517994,0.000599104,0.0002375045],"domain_scores_gemma":[0.9981254,0.0001400457,0.0004693735,0.0003402144,0.0008692032,0.00005572467],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000246959,0.00005128722,0.0001876259,0.00004142436,0.000005367671,2.192908e-8,0.0007182634,0.0002756841,0.03121182,0.8630213,0.0000303349,0.1044322],"study_design_scores_gemma":[0.0000139296,0.0001202928,0.0008789175,0.00008801484,0.000004254194,0.000001188998,0.0001837289,0.2680238,0.4733349,0.2571896,0.00006965358,0.00009166685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2046389,0.000009032367,0.7790237,0.001511395,0.0004198673,0.0003428084,0.000002889715,0.00008999134,0.01396141],"genre_scores_gemma":[0.9143881,0.00001673539,0.08538557,0.00007639713,0.00005412223,0.00001331278,5.36998e-7,0.000007633282,0.00005764008],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7097492,"threshold_uncertainty_score":0.4588552,"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."}}