{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001611815,0.0001010779,0.000132061,0.0003001565,0.00006893597,0.0003597392,0.0008858152,0.00005145758,0.0003233505],"category_scores_gemma":[0.0005854002,0.00009626986,0.0001262252,0.0002241044,0.00007611702,0.001419739,0.000119135,0.0002046032,0.00005042114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001958634,"about_ca_system_score_gemma":0.0001232704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001827372,"about_ca_topic_score_gemma":0.0000565657,"domain_scores_codex":[0.9980223,0.00004435359,0.0008964182,0.0001575058,0.0006994966,0.0001798867],"domain_scores_gemma":[0.9981779,0.0003171595,0.000428873,0.0001527827,0.000813212,0.0001101091],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00004730525,0.00007439597,0.001705349,0.000001194006,0.00003928412,0.00005843295,0.0004629885,0.001359077,0.005868081,0.08400863,0.00006400834,0.9063113],"study_design_scores_gemma":[0.0004893356,0.0007840145,0.06378627,0.0002617942,0.00004389324,0.001823484,0.003366802,0.1305635,0.6065891,0.1845343,0.006597644,0.001159916],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04481545,0.00002142452,0.9495004,0.001390313,0.002502776,0.00006754977,0.000002272811,0.00003145844,0.001668302],"genre_scores_gemma":[0.9142984,0.00001894003,0.08503629,0.0002794789,0.000346701,4.969557e-7,0.000001327042,0.000004350735,0.00001400194],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9051513,"threshold_uncertainty_score":0.3925771,"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."}}