{"id":"W2951775186","doi":"10.48550/arxiv.cs/0302038","title":"Tight Logic Programs","year":2003,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Transitive closure; Negation as failure; Negation; Logic program; Transitive relation; Closure (psychology); Predicate (mathematical logic); Computer science; Predicate logic; Mathematics; Discrete mathematics; Programming language; Calculus (dental); Stable model semantics; Logic programming; Description logic; Combinatorics; 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.002388788,0.0007323359,0.0007547511,0.001793055,0.001393524,0.003554243,0.001294046,0.0008748298,0.009040454],"category_scores_gemma":[0.009001153,0.0006978388,0.0009778081,0.001582956,0.004298862,0.008364297,0.004078829,0.003094634,0.0009029898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001661472,"about_ca_system_score_gemma":0.001188483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002697499,"about_ca_topic_score_gemma":0.002027872,"domain_scores_codex":[0.9970332,0.0006413942,0.0001626908,0.0007532624,0.001024144,0.0003852425],"domain_scores_gemma":[0.9955715,0.002220706,0.0004266245,0.0007526633,0.0006964051,0.0003320328],"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.00002171099,0.00001521549,0.0001658429,0.00005013108,0.0000092008,0.00005592697,0.0003587485,0.001677148,0.0005614396,0.9870329,0.001006707,0.009045036],"study_design_scores_gemma":[0.00001298675,0.00002198398,0.0001647407,0.00003089312,0.00001766504,0.00008953988,0.0001544943,0.009216039,0.0009391059,0.9704488,0.01889204,0.00001169351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06201983,0.001572237,0.8535936,0.00260119,0.00018338,0.000162006,0.0007570772,0.001958283,0.07715236],"genre_scores_gemma":[0.7808647,0.001656839,0.1832889,0.001314518,0.000406153,0.000302485,0.001316777,0.0005407794,0.03030894],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009040454,"threshold_uncertainty_score":0.03024328,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07016123141956032,"score_gpt":0.2742394754585043,"score_spread":0.204078244038944,"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."}}