概率逻辑程序与概率论证的可信最小未定义稳定语义

Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning Pub Date : 2022-07-01 DOI:10.24963/kr.2022/31

Victor Hugo Nascimento Rocha, Fabio Gagliardi Cozman

{"title":"概率逻辑程序与概率论证的可信最小未定义稳定语义","authors":"Victor Hugo Nascimento Rocha, Fabio Gagliardi Cozman","doi":"10.24963/kr.2022/31","DOIUrl":null,"url":null,"abstract":"We present an approach to probabilistic logic programming and probabilistic argumentation that combines elements of the L-stable semantics and the credal semantics. We derive the complexity of inferences, propose an extended version of argumentation graphs with a semantics that maps to the L- stable semantics, and introduce a definition for the probability of an argument.","PeriodicalId":351970,"journal":{"name":"Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning","volume":"639 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A Credal Least Undefined Stable Semantics for Probabilistic Logic Programs and Probabilistic Argumentation\",\"authors\":\"Victor Hugo Nascimento Rocha, Fabio Gagliardi Cozman\",\"doi\":\"10.24963/kr.2022/31\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present an approach to probabilistic logic programming and probabilistic argumentation that combines elements of the L-stable semantics and the credal semantics. We derive the complexity of inferences, propose an extended version of argumentation graphs with a semantics that maps to the L- stable semantics, and introduce a definition for the probability of an argument.\",\"PeriodicalId\":351970,\"journal\":{\"name\":\"Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning\",\"volume\":\"639 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.24963/kr.2022/31\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24963/kr.2022/31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

我们提出了一种结合l稳定语义和可信语义元素的概率逻辑规划和概率论证方法。我们推导了推理的复杂性，提出了具有映射到L稳定语义的语义的论证图的扩展版本，并引入了一个论证概率的定义。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Credal Least Undefined Stable Semantics for Probabilistic Logic Programs and Probabilistic Argumentation

We present an approach to probabilistic logic programming and probabilistic argumentation that combines elements of the L-stable semantics and the credal semantics. We derive the complexity of inferences, propose an extended version of argumentation graphs with a semantics that maps to the L- stable semantics, and introduce a definition for the probability of an argument.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning

自引率

0.00%

发文量