{"id":"W2015878287","doi":"10.2178/jsl/1203350790","title":"The complexity of resolution refinements","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; Simon Fraser University","funders":"","keywords":"Resolution (logic); Computer science; Algorithm; Tree (set theory); Mathematics; Artificial intelligence; Combinatorics","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.0173493,0.0007198498,0.001747996,0.002968031,0.002754812,0.006883423,0.003654446,0.003023433,0.009565853],"category_scores_gemma":[0.129803,0.001699228,0.00334485,0.003532818,0.008007035,0.01724874,0.007613705,0.006946213,0.001301114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003414315,"about_ca_system_score_gemma":0.002307357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003479401,"about_ca_topic_score_gemma":0.002021423,"domain_scores_codex":[0.97204,0.01028505,0.002143989,0.002734974,0.009910698,0.002885428],"domain_scores_gemma":[0.7705387,0.1923123,0.006082769,0.02186941,0.007320871,0.001875894],"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.0004934397,0.0001552372,0.005251771,0.0004994114,0.0001319909,0.0004045302,0.001680601,0.05482047,0.00294341,0.8661967,0.005557383,0.06186508],"study_design_scores_gemma":[0.00009242974,0.00004688741,0.0008583858,0.00008529826,0.00009828225,0.0003677962,0.0005098517,0.1607146,0.004484858,0.8268206,0.005859932,0.00006110899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2890561,0.001855161,0.6621467,0.009160824,0.0001593495,0.0006192895,0.001133443,0.002686677,0.03318245],"genre_scores_gemma":[0.8465355,0.001222424,0.1445236,0.000668647,0.0001886324,0.0003267978,0.001160558,0.0005066564,0.004867291],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0173493,"threshold_uncertainty_score":0.09175301,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07207676306605637,"score_gpt":0.2981267113148954,"score_spread":0.226049948248839,"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."}}