BriefGPT.xyz
Feb, 2021
Schaefer 框架下基于逻辑的论证的参数化复杂度
Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework
HTML
PDF
Yasir Mahmood, Arne Meier, Johannes Schmidt
TL;DR
本文研究了关于逻辑基础论证的命题变体,分别探讨了 ARG、ARG-Check、ARG-Rel 等三种计算任务的参数化难度,并在 Schaefer 的框架下对问题进行结构参数分类,给出了各问题在参数化难度上的界限,其中一些情况具有极高的难度。
Abstract
logic-based argumentation
is a well-established formalism modelling
nonmonotonic reasoning
. It has been playing a major role in AI for decades, now. Informally, a set of formulas is the support for a given claim
→