{"id":"W2185085875","doi":"10.1016/j.artint.2015.11.002","title":"SATenstein: Automatically building local search SAT solvers from components","year":2015,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Benchmark (surveying); Solver; Parameterized complexity; Boolean satisfiability problem; Local search (optimization); Satisfiability; Task (project management); Theoretical computer science; State (computer science); Algorithm; 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.001012321,0.002393586,0.001274815,0.001906733,0.0008172254,0.001709754,0.003561588,0.001577925,0.02148844],"category_scores_gemma":[0.006828846,0.00161551,0.002467274,0.002086691,0.001058154,0.002998892,0.002640539,0.00276792,0.00548804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001062963,"about_ca_system_score_gemma":0.002369319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005399802,"about_ca_topic_score_gemma":0.01998364,"domain_scores_codex":[0.9991308,0.0002834259,0.00005498639,0.0001882538,0.0002622256,0.00008020403],"domain_scores_gemma":[0.9975056,0.001692199,0.00007710903,0.000380264,0.0002949151,0.00004996027],"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.0006272364,0.0004643992,0.002822308,0.002117161,0.0004554038,0.0004010794,0.0002807404,0.2734805,0.01308155,0.04432954,0.08653526,0.5754048],"study_design_scores_gemma":[0.0001605109,0.00006548559,0.0002318015,0.00006061726,0.00008463174,0.00005348016,0.00005850552,0.9630673,0.005175594,0.02291726,0.008108315,0.0000165553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01407071,0.0005660508,0.9166148,0.0003412197,0.0001369391,0.0005153492,0.002166005,0.05319459,0.01239428],"genre_scores_gemma":[0.1051269,0.0002424923,0.8802177,0.0003381663,0.00003795782,0.0005733035,0.00543482,0.003562996,0.004465652],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02148844,"threshold_uncertainty_score":0.07188594,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1141609460867904,"score_gpt":0.3091856572084594,"score_spread":0.195024711121669,"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."}}