{"id":"W2005254071","doi":"10.1142/s0218213007003254","title":"SOLVING INCREMENTAL SATISFIABILITY","year":2007,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Satisfiability; Computer science; Completeness (order theory); Boolean satisfiability problem; Propositional calculus; Conjunctive normal form; Approximation algorithm; True quantified Boolean formula; Propositional formula; Mathematical optimization; Upper and lower bounds; Mathematics; Theoretical computer science; Algorithm; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001592589,0.0006130134,0.0007590812,0.0007795276,0.0006173913,0.000956257,0.001805352,0.0009167158,0.002802696],"category_scores_gemma":[0.008824099,0.000528356,0.00144151,0.001095167,0.0008300873,0.001715877,0.001472267,0.001159787,0.0003150252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000739753,"about_ca_system_score_gemma":0.001980173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002361387,"about_ca_topic_score_gemma":0.004542158,"domain_scores_codex":[0.9986749,0.0005227952,0.00007787766,0.0001665202,0.0004057802,0.000152129],"domain_scores_gemma":[0.9945471,0.004025076,0.0003108136,0.0005959422,0.0004512114,0.00006980402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000227083,0.0003406789,0.004885864,0.001055099,0.0002754741,0.0006207703,0.0005794709,0.4259429,0.01782079,0.1274205,0.007389546,0.4134419],"study_design_scores_gemma":[0.00007835742,0.000142157,0.0006468323,0.00004986347,0.0001150162,0.0002957361,0.0001449806,0.9015918,0.012032,0.07870886,0.006171055,0.00002317158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06003673,0.0003536908,0.9335511,0.0003633449,0.00004540808,0.0002538429,0.0001463051,0.001006032,0.004243468],"genre_scores_gemma":[0.3162474,0.000539333,0.6799832,0.0001503051,0.00005206729,0.000323086,0.0006656356,0.0001146071,0.001924427],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002802696,"threshold_uncertainty_score":0.009375989,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05154072613426004,"score_gpt":0.3305258114139577,"score_spread":0.2789850852796977,"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."}}