{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004145349,0.0004514042,0.0004637943,0.0001031269,0.0001703159,0.0003045647,0.002288064,0.0004542201,0.00008691093],"category_scores_gemma":[0.000102109,0.0003662874,0.000280933,0.0003352983,0.000115335,0.0001825274,0.00180685,0.0008095488,0.001836478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000106011,"about_ca_system_score_gemma":0.000255574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003411361,"about_ca_topic_score_gemma":0.00001981691,"domain_scores_codex":[0.9973216,0.0001645331,0.0003689323,0.001176496,0.0003135616,0.0006548951],"domain_scores_gemma":[0.9975881,0.00005193525,0.0002578869,0.001696159,0.0001843019,0.0002215955],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00000949662,0.001110717,0.7246233,0.0003933973,0.0002501601,0.0004241163,0.002770974,0.00005748787,0.0001941884,0.1991548,0.01494918,0.05606218],"study_design_scores_gemma":[0.001783492,0.0007756236,0.337082,0.0007439947,0.0001768529,0.0002116093,0.00007554114,0.005441582,0.00326404,0.1608723,0.484905,0.004667932],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5032629,0.005951012,0.1712166,0.001753851,0.01078236,0.001696557,0.00000504526,0.002212477,0.3031192],"genre_scores_gemma":[0.9741566,0.0001748018,0.01462277,0.0007128149,0.0004799545,0.0001524785,0.00002839075,0.0000364001,0.009635775],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4708937,"threshold_uncertainty_score":0.9998789,"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."}}