Probabilistic Bipolar Abstract Argumentation Frameworks: Complexity Results Bettina Fazzinga1 and Sergio Flesca2 and Filippo Furfaro2

登录免费注册

资源分类

论文
算法
数据集
经验分享
技术动态
行业动态

论文
学习
研究领域

算法
学习
研究领域

数据集
自动驾驶
图片

经验分享
学习
研究领域

技术动态
计算机视觉
自然语言处理

行业动态
教育
语音识别

》资源》论文》Probabilistic Bipolar Abstract Argumentation Frameworks: Complexity Results Bettina Fazzinga1 and Sergio Flesca2 and Filippo Furfaro2

Probabilistic Bipolar Abstract Argumentation Frameworks: Complexity Results Bettina Fazzinga1 and Sergio Flesca2 and Filippo Furfaro2

2019-11-05 |

58 |

55 |

Probabilistic Bipolar Abstract Argumentation Frameworks: Complexity Results Bettina Fazzinga1 and Sergio Flesca2 and Filippo Furfaro2
论文

Abstract Frameworks (prBAFs) are considered, and the complexity of the fundamental problem of computing extensions’ probabilities is addressed. The most popular semantics of supports and extensions are considered, as well as different paradigms for defining the probabilistic encoding of the uncertainty. Interestingly, the presence of supports, which does not alter the complexity of verifying extensions in the deterministic case, is shown to introduce a new source of complexity in some probabilistic settings, for which tractable cases are also identified.

上一篇：A Study of Argumentative Characterisations of Preferred Subtheories Marcello D’Agostino1 and Sanjay Modgil2

下一篇：From Conjunctive Queries to Instance Queries in Ontology-Mediated Querying

用户评价