{"id":"W1608678069","doi":"10.1023/a:1006241826565","title":"Efficient Algorithms to Detect and Restore Minimality, an Extension of the Regular Restriction of Resolution","year":2000,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Binary tree; Mathematics; Tree (set theory); Resolution (logic); Algorithm; Completeness (order theory); Binary number; Redundancy (engineering); K-ary tree; Discrete mathematics; Computer science; Combinatorics; Tree structure; Arithmetic; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.001244123,0.00008892,0.000219921,0.0001394837,0.0001170638,0.00004394452,0.0003406307,0.00007811744,0.000001822886],"category_scores_gemma":[0.0001428777,0.00005768944,0.00007558623,0.0005298491,0.00004982496,0.0001339198,0.00007041412,0.0001229946,6.901492e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005160955,"about_ca_system_score_gemma":0.0000694936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001246629,"about_ca_topic_score_gemma":0.000005228793,"domain_scores_codex":[0.9984931,0.0002504816,0.0004943461,0.0001617008,0.0004483011,0.0001520926],"domain_scores_gemma":[0.9987363,0.00004486994,0.0005274351,0.0003297566,0.0002720457,0.0000896262],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005637521,0.0005101673,0.005254589,0.0002566999,0.0002004205,0.0001796397,0.01164204,0.1247863,0.1362304,0.01285566,0.001456559,0.7060637],"study_design_scores_gemma":[0.0008391131,0.001793515,0.2076059,0.0004666439,0.00005736866,0.000887552,0.0002439699,0.7715105,0.01428064,0.0008432201,0.00126653,0.0002050281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9618152,0.0004613088,0.03697601,0.0001180215,0.0003036908,0.0001321002,4.156738e-7,0.00006276829,0.0001304732],"genre_scores_gemma":[0.9751753,0.00002347906,0.02470164,0.00001081964,0.00005702603,7.130691e-7,1.770808e-7,0.000005742363,0.00002512587],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7058588,"threshold_uncertainty_score":0.2352507,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01596893507555962,"score_gpt":0.2606211021731402,"score_spread":0.2446521670975806,"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."}}