{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006805233,0.001640577,0.003217431,0.00341813,0.004151086,0.01212169,0.005989495,0.003791499,0.02257802],"category_scores_gemma":[0.05143768,0.002793246,0.00441031,0.006702959,0.008644517,0.04957543,0.01052215,0.0116914,0.00217457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004741641,"about_ca_system_score_gemma":0.002420031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002953979,"about_ca_topic_score_gemma":0.002424152,"domain_scores_codex":[0.9870788,0.004487973,0.0008207566,0.001867726,0.004377437,0.001367391],"domain_scores_gemma":[0.8881949,0.09928574,0.002603382,0.006228388,0.002227501,0.001460071],"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.0003337468,0.0001237215,0.0009861497,0.0003800789,0.0001106593,0.000240555,0.0007392195,0.01678671,0.0009227593,0.9448597,0.006623199,0.0278935],"study_design_scores_gemma":[0.00003373512,0.00001315599,0.0001800926,0.00002832769,0.00004167241,0.0001135147,0.00009062353,0.01879054,0.0004686741,0.9782402,0.001974509,0.00002500496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2383176,0.009822821,0.5338817,0.02466399,0.0008513344,0.0003290338,0.002468053,0.002087346,0.1875781],"genre_scores_gemma":[0.8667644,0.004535774,0.09950968,0.001557539,0.00157915,0.000366381,0.002010696,0.0007790418,0.02289746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02257802,"threshold_uncertainty_score":0.07553107,"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."}}