{"id":"W92682349","doi":"","title":"A New Branch and Bound Method for Incremental Satisfiability Problem.","year":2004,"lang":"en","type":"article","venue":"International Conference on Computational Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Branch and bound; Satisfiability; Boolean satisfiability problem; Scheduling (production processes); Conjunctive normal form; Computer science; Routing (electronic design automation); Mathematical optimization; Upper and lower bounds; Theoretical computer science; Mathematics","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.002359453,0.001414686,0.001444695,0.002543191,0.001229942,0.002427092,0.003315681,0.001637655,0.0116171],"category_scores_gemma":[0.008544403,0.0009855852,0.001714531,0.002645952,0.001561724,0.004513125,0.002842939,0.004722142,0.003047686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001727822,"about_ca_system_score_gemma":0.00278193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003903918,"about_ca_topic_score_gemma":0.004611555,"domain_scores_codex":[0.9973853,0.000650432,0.0001469117,0.0004631376,0.001137271,0.0002168833],"domain_scores_gemma":[0.9964133,0.002455962,0.0001624777,0.0004290932,0.0004122789,0.0001269131],"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.0002740116,0.0002380269,0.0007325464,0.0009553989,0.0002174004,0.0002697269,0.0003519632,0.1068398,0.009305414,0.2234325,0.03591253,0.6214707],"study_design_scores_gemma":[0.0001975549,0.0001280105,0.0002769428,0.0001742738,0.0001606295,0.000394352,0.00007792749,0.7293622,0.008364447,0.1955619,0.06522321,0.00007845379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008794121,0.0004444888,0.9940127,0.0002469916,0.00008379625,0.0001062493,0.0001027963,0.0009137714,0.003209766],"genre_scores_gemma":[0.02942832,0.0004825257,0.9644397,0.0002911847,0.000111109,0.0005103228,0.0005934816,0.0005837251,0.003559566],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0116171,"threshold_uncertainty_score":0.03886306,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08678413591221729,"score_gpt":0.3965719329139487,"score_spread":0.3097877970017314,"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."}}