{"id":"W2556118493","doi":"","title":"Depth-based Local Search Heuristics for Boolean Circuit Satisfiability","year":2010,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Heuristics; Boolean satisfiability problem; Heuristic; Satisfiability; Completeness (order theory); Local search (optimization); Maximum satisfiability problem; Computer science; Algorithm; Theoretical computer science; Variable (mathematics); Mathematical optimization; Mathematics; Boolean function","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.001513423,0.0005501277,0.0007777283,0.001244168,0.0005123045,0.0006045682,0.001361676,0.0008475594,0.003711978],"category_scores_gemma":[0.006930173,0.0004110638,0.0008825348,0.0008857707,0.00116951,0.001387103,0.001535746,0.001270883,0.0004957318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001074756,"about_ca_system_score_gemma":0.001723043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00165108,"about_ca_topic_score_gemma":0.005193084,"domain_scores_codex":[0.9989635,0.0005119545,0.00004884943,0.0001066694,0.0002814087,0.00008768663],"domain_scores_gemma":[0.9965443,0.0025386,0.0002358528,0.0003607611,0.0002213303,0.00009920864],"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.0003855699,0.0002437877,0.002548339,0.0004639493,0.00009927841,0.0001902285,0.0004057133,0.5682132,0.01857003,0.1185387,0.003834352,0.2865069],"study_design_scores_gemma":[0.00007135182,0.0001015309,0.0001980138,0.00001985677,0.00002555668,0.00004466326,0.00004355871,0.9572729,0.003506992,0.03704352,0.001656528,0.00001559983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03041707,0.0002296796,0.9656726,0.0001996103,0.00001799168,0.0001516761,0.00007639841,0.0009384492,0.00229644],"genre_scores_gemma":[0.4156328,0.0001484274,0.5820345,0.0001410509,0.00002509107,0.0002922014,0.0002765979,0.0002690167,0.001180405],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003711978,"threshold_uncertainty_score":0.01241779,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05270903099005436,"score_gpt":0.3290128017679618,"score_spread":0.2763037707779074,"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."}}