{"id":"W1571909284","doi":"10.1007/3-540-45465-9_20","title":"On the Complexity of Resolution with Bounded Conjunctions","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Resolution (logic); Hierarchy; Proof complexity; Bounded function; Space (punctuation); Mathematics; Upper and lower bounds; Computer science; Discrete mathematics; Algorithm; Combinatorics; Mathematical proof; Artificial intelligence; Geometry; Mathematical analysis","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006852089,0.0003455901,0.0003672596,0.0003822471,0.0003676046,0.0002465933,0.002423011,0.0001482262,0.000071553],"category_scores_gemma":[0.0000697052,0.0002161434,0.000093479,0.0005550127,0.002946998,0.0002631985,0.0005189822,0.0005981519,0.00003130558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001584179,"about_ca_system_score_gemma":0.0001868195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002586589,"about_ca_topic_score_gemma":0.00004662596,"domain_scores_codex":[0.9975088,0.00004592869,0.000344272,0.0008477423,0.0008637187,0.0003895579],"domain_scores_gemma":[0.9970666,0.0008273049,0.0003034132,0.001548426,0.000179752,0.00007453417],"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.000008498291,0.00003514137,0.000005645265,0.00001156775,0.00001173697,0.00001255966,0.0002941179,0.004756247,0.00003947709,0.9623309,0.00007891728,0.03241518],"study_design_scores_gemma":[0.0001569923,0.000277852,0.0001191831,0.0002835777,0.000006205561,0.00004043313,1.842367e-7,0.3307738,0.0005982383,0.6669837,0.0005023401,0.0002575875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002134014,0.0001168265,0.9862298,0.002089733,0.0005830083,0.0003086031,0.000006429444,0.0001121513,0.01034008],"genre_scores_gemma":[0.7792568,0.00002985654,0.2163746,0.003491592,0.0002588819,0.00001482676,0.000005174528,0.0000391556,0.0005291108],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7790434,"threshold_uncertainty_score":0.9997664,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03747163055043265,"score_gpt":0.2293775713331463,"score_spread":0.1919059407827136,"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."}}