{"id":"W1496739046","doi":"10.1007/978-3-540-24677-0_56","title":"Systematic versus Non-systematic Methods for Solving Incremental Satisfiability","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Satisfiability; Computer science; Propositional calculus; Boolean satisfiability problem; Conjunctive normal form; Propositional formula; Completeness (order theory); Set (abstract data type); Approximation algorithm; Mathematical optimization; Theoretical computer science; Algorithm; Mathematics; Propositional variable","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":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.01378652,0.0007702424,0.001711986,0.000915199,0.00047669,0.0009548182,0.005962932,0.0004707543,0.000003508737],"category_scores_gemma":[0.004412611,0.0006750519,0.0003434042,0.00149664,0.0006498868,0.001233369,0.001506093,0.0007489009,0.00001954661],"about_ca_system_candidate":true,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004933062,"about_ca_system_score_gemma":0.003272628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000240981,"about_ca_topic_score_gemma":0.00002814186,"domain_scores_codex":[0.993286,0.0005908135,0.001806025,0.002052684,0.00124929,0.001015187],"domain_scores_gemma":[0.9894066,0.0055742,0.001210244,0.003105735,0.0004865494,0.000216684],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"systematic_review","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009790737,0.0003220122,0.00001815134,0.7056432,0.0003193582,0.00003256004,0.01479397,0.07102211,0.00188513,0.05346028,0.00004119343,0.1523642],"study_design_scores_gemma":[0.0007677797,0.0003768991,0.00001720565,0.03339946,0.00007552916,0.00003982738,0.000001490381,0.8972959,0.004733522,0.06249325,0.000008098675,0.0007910682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001741453,0.000684251,0.9866359,0.0000766718,0.006593015,0.005313579,0.000005166918,0.0002317046,0.0004423465],"genre_scores_gemma":[0.004887049,0.000005927953,0.9939336,0.0002400884,0.0002810739,0.0004950996,0.000006921493,0.00004667735,0.0001036136],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8262737,"threshold_uncertainty_score":0.9995701,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03358788017929245,"score_gpt":0.3477794127939009,"score_spread":0.3141915326146085,"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."}}