{"id":"W1531985259","doi":"10.1007/3-540-45757-7_38","title":"An Infinite-Valued Semantics for Logic Programs with Negation","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Negation; Uncountable set; Countable set; Zero (linguistics); Mathematics; Discrete mathematics; Truth value; Element (criminal law); Denotational semantics; Set (abstract data type); Semantics (computer science); Computer science; Operational semantics; Programming language; Linguistics","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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007150056,0.0005926872,0.0005427647,0.0005462175,0.0003755852,0.001037114,0.002993036,0.0003771712,0.00001056478],"category_scores_gemma":[0.000079882,0.0004506622,0.0001242952,0.0006898039,0.0006623086,0.0008246267,0.0004199587,0.0005348732,0.00002906138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000186259,"about_ca_system_score_gemma":0.0003419759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009540827,"about_ca_topic_score_gemma":0.00008285032,"domain_scores_codex":[0.9962937,0.0000385814,0.0004383834,0.001631055,0.000808945,0.0007893514],"domain_scores_gemma":[0.9971614,0.0002903455,0.0003634064,0.001412715,0.0005437772,0.0002283655],"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.00001592615,0.0001560696,0.0002517969,0.0001007794,0.00001947414,0.00005843732,0.002110338,0.01205687,0.00003258155,0.219761,0.00002336319,0.7654133],"study_design_scores_gemma":[0.0005018852,0.001484091,0.00008651853,0.0002828299,0.00001776812,0.00007729299,2.545945e-7,0.8349906,0.0002699783,0.1594085,0.002104837,0.0007753741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001215956,0.0002061342,0.9936292,0.0002824655,0.0009136366,0.0009906857,0.000002724683,0.0003209029,0.003532699],"genre_scores_gemma":[0.1690281,0.00002926409,0.828712,0.0008936839,0.0006895051,0.00004588932,0.00002285382,0.00005027684,0.0005284337],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8229338,"threshold_uncertainty_score":0.9999999,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02987368681877527,"score_gpt":0.2572652989229092,"score_spread":0.2273916121041339,"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."}}