{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007570294,0.0002091988,0.0001770531,0.0001793228,0.0001593151,0.0003920999,0.0009478928,0.0000762699,0.00008011408],"category_scores_gemma":[0.0002395903,0.0002140351,0.00006951121,0.0002165371,0.00009090627,0.0007262385,0.0001895129,0.0001760456,0.00004477045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002257015,"about_ca_system_score_gemma":0.0004102311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001980207,"about_ca_topic_score_gemma":0.00002639363,"domain_scores_codex":[0.9979852,0.00008320021,0.0004774498,0.0006509628,0.0005755836,0.0002275758],"domain_scores_gemma":[0.9984845,0.0003737912,0.0001975491,0.0002611231,0.0005386475,0.0001443853],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003718336,0.00005467821,0.00005690093,0.00001086118,0.00002411996,6.952417e-7,0.0003628343,0.03149872,0.0004345045,0.8268421,0.00005136472,0.140626],"study_design_scores_gemma":[0.0002435811,0.0001712213,0.0009592589,0.00004334907,0.00000319467,0.00002034807,0.00002568303,0.3494074,0.005203458,0.6434487,0.0003061517,0.0001677464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001584904,0.00002124384,0.9897211,0.004125725,0.0005515874,0.0005187063,0.00002447607,0.0001104286,0.003341884],"genre_scores_gemma":[0.3695343,0.000008350787,0.6298085,0.000430353,0.00006665749,0.00005307279,0.00001978105,0.000006998793,0.00007201003],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3679494,"threshold_uncertainty_score":0.8728099,"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."}}