arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1703.08397cs.AI
收藏

结构化辩论中的案例推理

Reasoning by Cases in Structured Argumentation

Ruhr University Bochum(波鸿鲁尔大学)

Mathieu Beirlaen, Jesse Heyninck, Christian Straßer

摘要:

我们扩展了结构化论证的$ASPIC^+$框架,以便允许应用的情况下,推理方案的可废止的参数。给定一个带有结论“$A$ or $B$”的论证,一个基于$A$带有结论$C$的论证,以及一个基于$B$带有结论$C$的论证,我们允许构造一个带有结论$C$的论证。我们展示了我们的框架如何导致不同的结果比其他方法在非单调逻辑处理析取信息,如析取默认理论或方法的基础上的OR规则(允许导出一个可废止的规则“如果($A$或$B$),然后$C$”,给出两个可废止的规则“如果$A$,然后$C$”和“如果$B$,然后$C$”)。我们提出了新的问题,推理的微妙之处defeably与析取信息,并表明其形式化是更复杂的比一个人会假设。

英文摘要:

We extend the $ASPIC^+$ framework for structured argumentation so as to allow applications of the reasoning by cases inference scheme for defeasible arguments. Given an argument with conclusion `$A$ or $B$', an argument based on $A$ with conclusion $C$, and an argument based on $B$ with conclusion $C$, we allow the construction of an argument with conclusion $C$. We show how our framework leads to different results than other approaches in non-monotonic logic for dealing with disjunctive information, such as disjunctive default theory or approaches based on the OR-rule (which allows to derive a defeasible rule `If ($A$ or $B$) then $C$', given two defeasible rules `If $A$ then $C$' and `If $B$ then $C$'). We raise new questions regarding the subtleties of reasoning defeasibly with disjunctive information, and show that its formalization is more intricate than one would presume.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑