论元系统是基于一个人可以为命题构造论元的想法;即,证明对一个命题的信念的结构化的理由。使用可废止规则,论证不需要在所有情况下都有效,因此,可以为命题及其否定构造一个论证。当论点支持相互冲突的命题时,其中一个论点必须被击败,这就提出了\emph{which (sub-)arguments can be subject to defeat}的问题。在法律论证中,元规则通过考虑冲突中每个论证的最后一条可废止规则来确定有效论证。由于使用最后一个规则来评估参数更容易,因此\emph{can a conflict be resolved by considering only the last defeasible rules of the arguments involved}?我们提出了一个新的论点系统,而不是推导出一个失败的参数之间的关系,\emph{undercutting-arguments}的失败可废止的规则构造。这个系统允许我们,(\textit{i})解决冲突(反驳参数的概括)只使用不一致的参数的最后规则,(\textit{ii})确定一组有效的(不败)参数在线性时间使用的算法的基础上JTMS,(\textit{iii})建立与默认逻辑的关系,和(\textit{iv})证明封闭属性,如\emph{cumulativity}。我们还提出了一个扩展的论点系统,使\emph{reasoning by cases}。
英文摘要:
Argument systems are based on the idea that one can construct arguments for propositions; i.e., structured reasons justifying the belief in a proposition. Using defeasible rules, arguments need not be valid in all circumstances, therefore, it might be possible to construct an argument for a proposition as well as its negation. When arguments support conflicting propositions, one of the arguments must be defeated, which raises the question of \emph{which (sub-)arguments can be subject to defeat}?
In legal argumentation, meta-rules determine the valid arguments by considering the last defeasible rule of each argument involved in a conflict. Since it is easier to evaluate arguments using their last rules, \emph{can a conflict be resolved by considering only the last defeasible rules of the arguments involved}?
We propose a new argument system where, instead of deriving a defeat relation between arguments, \emph{undercutting-arguments} for the defeat of defeasible rules are constructed. This system allows us, (\textit{i}) to resolve conflicts (a generalization of rebutting arguments) using only the last rules of the arguments for inconsistencies, (\textit{ii}) to determine a set of valid (undefeated) arguments in linear time using an algorithm based on a JTMS, (\textit{iii}) to establish a relation with Default Logic, and (\textit{iv}) to prove closure properties such as \emph{cumulativity}. We also propose an extension of the argument system that enables \emph{reasoning by cases}.
Discerning and Resolving Knowledge Conflicts through Adaptive Decoding with Contextual Information-Entropy Constraint
Institute of Automation, Chinese Academy of Sciences(中国科学院自动化研究所);School of Artificial Intelligence, University of Chinese Academy of Sciences(中国科学院大学人工智能学院);Beijing Academy of Artificial Intelligence(北京人工智能研究院);Unisound AI Technology Co., Ltd.(云知声人工智能科技有限公司);Shanghai Artificial Intelligence Laboratory(上海人工智能实验室)
Multi-User Personalisation in Human-Robot Interaction: Resolving Preference Conflicts Using Gradual Argumentation
Institut de Robòtica i Informàtica Industrial(机器人与信息技术研究所);CSIC-UPC(西班牙国家科研学院-巴塞罗那理工大学);Institut d’Investigació en Intel·ligència Artificial(人工智能研究所);IIIA-CSIC(人工智能研究所-西班牙国家科研学院)
OR-VSKC: Resolving Visual-Semantic Knowledge Conflicts in Operating Rooms with Synthetic Data-Guided Alignment
Shanghai University of Engineering Science(上海工程技术大学);Tencent YouTu Lab(腾讯优图实验室);Clinical Research Unit, Zhongshan Hospital of Fudan University(复旦大学中山医院临床研究部)
ArbESC+: Arabic Enhanced Edit Selection System Combination for Grammatical Error Correction Resolving conflict and improving system combination in Arabic GEC
Department of Computer Sciences, Faculty of Computing and Information Technology(计算机科学系,计算与信息技术学院);King Abdulaziz University(国王阿卜杜勒阿齐兹大学);Saudi Electronic University(沙特电子大学)
ArgRE: Formal Argumentation for Conflict Resolution in Multi-Agent Requirements Negotiation
Department of Computer Science and Communications Engineering, Waseda University(早稻田大学计算机科学与通信工程系);College of Architecture and Urban Planning, Tongji University(同济大学建筑与城市规划学院);Advanced Institute of So-Go-Chi (Convergence Knowledge) Informatics, Tohoku University(东北大学So-Go-Chi(融合知识)信息学高级研究所);Aisin Corporation(日产公司)
Dialectical Alignment: Resolving the Tension of 3H and Security Threats of LLMs
King Abdullah University of Science and Technology(阿卜杜拉国王科技大学);University of Macau(澳门大学);Zhejiang University(浙江大学);Tongji University(同济大学);University of Hamburg(汉堡大学);South China University of Technology(华南理工大学)
本文提出辩证对齐框架,利用 AI 反馈构建训练数据,以提升大语言模型对投毒上下文攻击的防御能力,同时保持上下文知识编辑效果,无需额外提示工程。