{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006734012,0.001239359,0.002113327,0.00272951,0.001511316,0.003167121,0.00542088,0.002052597,0.004109008],"category_scores_gemma":[0.02278696,0.00124476,0.002000976,0.001955247,0.003605816,0.006762842,0.006386683,0.003505337,0.00145222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009660908,"about_ca_system_score_gemma":0.002116723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001983669,"about_ca_topic_score_gemma":0.00253204,"domain_scores_codex":[0.9942963,0.001526966,0.0004293676,0.001501898,0.001624738,0.0006208457],"domain_scores_gemma":[0.981941,0.00885844,0.001224982,0.005931763,0.00166807,0.0003757509],"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.0008759288,0.0004925005,0.002733762,0.000587809,0.000196897,0.0002576292,0.0008325181,0.05183705,0.01679175,0.2108137,0.01352078,0.7010597],"study_design_scores_gemma":[0.0002154961,0.0001798054,0.000647672,0.00008177028,0.0001591367,0.0005491465,0.0003145678,0.5291929,0.02739227,0.4303547,0.01079487,0.0001177975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01405165,0.0001988817,0.9810849,0.0002622046,0.0000615712,0.0001296504,0.00007855035,0.002249849,0.001882641],"genre_scores_gemma":[0.187248,0.0002336819,0.8081149,0.0002518613,0.00008793017,0.0001566547,0.0004599617,0.0006351806,0.002811866],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006734012,"threshold_uncertainty_score":0.0356133,"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."}}