Backing and Undercutting in Defeasible Logic Programming
Backing and Undercutting in Defeasible Logic Programming
复制标题
可废逻辑编程中的支持和削弱
DOI：
--
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
Guillermo R. Simari
中科院分区：
文献类型：
--
作者：
Andrea Cohen;A. García;Guillermo R. Simari
经典论证领域的两个重要概念是削弱反对者和支持者。前者代表对推理步骤的攻击，后者旨在提供针对此类攻击的防御。可废逻辑编程（DELP）是一种具体论证系统，可以识别结论或中间结论相互矛盾的论证，捕捉反驳失败者的概念。然而，在 DELP 中，不可能既不代表削弱的反对者，也不代表支持者。这项工作的目的是扩展 DELP 的形式主义，以允许攻击和支持可废止的规则。因此，将有可能为代表削弱反对者和支持者建立论据。
Two important notions within the field of classical argumentation are undercutting defeaters and backings. The former represent an attack to an inference step, and the latter intend to provide defense against this type of attack. Defeasible Logic Programming (DELP) is a concrete argumentation system that allows to identify arguments whose conclusions or intermediate conclusions are in contradiction, capturing the notion of rebutting defeater. Nevertheless, in DELP is not possible to represent neither undercutting defeaters nor backings. The aim of this work is to extend the formalism of DELP to allow attack and support for defeasible rules. Thus, it will be possible to build arguments for representing undercutting defeaters and backings.