{"id":"W64307931","doi":"10.5591/978-1-57735-516-8/ijcai11-092","title":"Depth-driven circuit-level stochastic local search for SAT","year":2011,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Boolean satisfiability problem; Completeness (order theory); Computer science; Local search (optimization); Boolean circuit; Satisfiability; Heuristic; Key (lock); Algorithm; Theoretical computer science; Search algorithm; Stochastic computing; Logic gate; Mathematics; Artificial intelligence","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.0009896377,0.0005681948,0.0007991181,0.0006815402,0.0004141619,0.0006952593,0.002012466,0.0008830682,0.004668379],"category_scores_gemma":[0.004680276,0.000449634,0.0008078711,0.0009178708,0.0009713642,0.001084004,0.001648616,0.001505841,0.000847922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001197014,"about_ca_system_score_gemma":0.001701982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002336515,"about_ca_topic_score_gemma":0.00535041,"domain_scores_codex":[0.9991199,0.0003288947,0.0000343342,0.0001303776,0.0003047423,0.00008167692],"domain_scores_gemma":[0.9981273,0.001270966,0.0001128176,0.0002692274,0.0001616987,0.00005806919],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009742355,0.00006866825,0.0005931437,0.000187873,0.00004678407,0.00007288119,0.00007274253,0.823873,0.005061225,0.09139066,0.003340805,0.07519468],"study_design_scores_gemma":[0.00002045823,0.00002500419,0.00003305255,0.000004626236,0.000005791416,0.00001445636,0.000004149217,0.9829268,0.0008035196,0.01535836,0.0007995074,0.000004240619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009340478,0.0001146778,0.9868699,0.0001566174,0.00001978186,0.00006344635,0.00009080517,0.0007386052,0.002605714],"genre_scores_gemma":[0.3586719,0.0002129339,0.6365651,0.0002798782,0.00004334906,0.0003921296,0.0004585014,0.000338715,0.003037559],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004668379,"threshold_uncertainty_score":0.01561731,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1223191680826042,"score_gpt":0.2738664491365895,"score_spread":0.1515472810539854,"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."}}