{"id":"W3117330206","doi":"10.1093/logcom/exaa065","title":"Lifting propositional proof compression algorithms to first-order logic","year":2020,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Resolution (logic); Propositional calculus; Literal (mathematical logic); Proof complexity; Algorithm; Computer science; Propositional variable; Automated reasoning; Zeroth-order logic; Conjunctive normal form; Proof theory; Well-formed formula; Intuitionistic logic; Automated theorem proving; Mathematics; First-order logic; Intermediate logic; Calculus (dental); Discrete mathematics; Theoretical computer science; Programming language; Description logic; Multimodal logic","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.003408751,0.001019462,0.0008865323,0.003334055,0.0007982586,0.002245524,0.002224777,0.0008952168,0.004303084],"category_scores_gemma":[0.01684517,0.0005562341,0.001395944,0.002850814,0.001537892,0.004134235,0.002840623,0.002881298,0.0009777453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00209517,"about_ca_system_score_gemma":0.00223062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002848767,"about_ca_topic_score_gemma":0.002650528,"domain_scores_codex":[0.9952635,0.0014479,0.0002855528,0.0004106472,0.002341933,0.0002504266],"domain_scores_gemma":[0.9852111,0.008228414,0.0006281214,0.003834427,0.001873538,0.0002244357],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003130251,0.0002932315,0.001032684,0.0004740971,0.0001114668,0.0001327999,0.0005734412,0.07104407,0.01089656,0.1024208,0.006349431,0.8063583],"study_design_scores_gemma":[0.0001688145,0.0001777827,0.0008118864,0.0001816531,0.0001072072,0.0004237966,0.0001789019,0.7335134,0.03955893,0.2020413,0.02278289,0.0000534941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04143269,0.001537004,0.9441988,0.0007368369,0.000134477,0.000396245,0.0002733878,0.006194846,0.005095671],"genre_scores_gemma":[0.1909127,0.001028484,0.8031125,0.0002710161,0.0001188057,0.0002729408,0.001001326,0.0006090646,0.002673199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004303084,"threshold_uncertainty_score":0.01802737,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04514012537969444,"score_gpt":0.2919407493478152,"score_spread":0.2468006239681207,"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."}}