首页/论文/2007.00732

arXiv 2007.007322020-07-01cs.LO

Context Graphs for Legal Reasoning and Argumentation

Max Rapp, Axel Adrian, Michael Kohlhase

英文摘要：

We propose a new, structured, logic-based framework for legal reasoning and argumentation: Instead of using a single, unstructured meaning space, theory graphs organize knowledge and inference into collections of modular meaning spaces organized by inheritance and interpretation. Context graphs extend theory graphs by attack relations and interpret theories as knowledge contexts of agents in argumentation. We introduce the context graph paradigm by modeling the well-studied case Popov v. Hayashi, concentrating on the role of analogical reasoning in context graphs.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

计算共识：一种基于论证的审议过程推理逻辑

Computing consensus: A logic for reasoning about deliberative processes based on argumentation

我们认为多代理论证，每个代理的观点的参数编码为一个论证框架（AF）。然后，我们研究审议过程比可以在此基础上发生。我们认为审议过程是一个单一的联合AF的逐步聚合的形状，我们感兴趣的是对可能结果的空间进行推理。我们对审议过程的唯一限制是，它们应该满足忠实性，这一假设相当于要求，每当审议导致在两个论点之间引入一种新的关系时，这种关系至少要得到一个参与主体的认可。我们使用模态逻辑的原因所产生的审议结构，我们提供了一些技术成果的模型检验。我们也给出了一个例子，并提出了一些未来工作的方向。

2014-08-07cs.LO

Equipping sequent-based argumentation with defeasible assumptions

In many expert and everyday reasoning contexts it is very useful to reason on the basis of defeasible assumptions. For instance, if the information at hand is incomplete we often use plausible assumptions, or if the information is conflicting we interpret it as consistent as possible. In this paper sequent-based argumentation, a form of logical argumentation in which arguments are represented by a sequent, is extended to incorporate assumptions. The resulting assumptive framework is general, in that some other approaches to reasoning with assumptions can adequately be represented in it. To exe…

2018-04-23cs.LO

Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation

University of Helsinki（赫尔辛基大学）；Graz University of Technology（格拉茨工业大学）

Assumption-based argumentation (ABA) is a central structured argumentation formalism. As shown recently, answer set programming (ASP) enables efficiently solving NP-hard reasoning tasks of ABA in practice, in particular in the commonly studied logic programming fragment of ABA. In this work, we harness recent advances in incremental ASP solving for developing effective algorithms for reasoning tasks in the logic programming fragment of ABA that are presumably hard for the second level of the polynomial hierarchy, including skeptical reasoning under preferred semantics as well as preferential r…

2021-08-09cs.AIcs.LO

Counting Complexity for Reasoning in Abstract Argumentation

TU Dresden（德累斯顿工业大学）；TU Wien（维也纳工业大学）；University of Potsdam（波茨坦大学）

In this paper, we consider counting and projected model counting of extensions in abstract argumentation for various semantics. When asking for projected counts we are interested in counting the number of extensions of a given argumentation framework while multiple extensions that are identical when restricted to the projected arguments count as only one projected extension. We establish classical complexity results and parameterized complexity results when the problems are parameterized by treewidth of the undirected argumentation graph. To obtain upper bounds for counting projected extension…

2018-11-28cs.AIcs.LO

非单调逻辑中基于推理的方法与形式论证的关系

Relations between assumption-based approaches in nonmonotonic logic and formal argumentation

Institute of Philosophy II, Ruhr Universität Bochum（波鸿鲁尔大学第二哲学研究所）；Ruhr Universität Bochum（波鸿鲁尔大学）

在本文中，我们作出的贡献，统一的形式模型的可废止推理。我们提出了几个翻译之间的正式论证框架和非单调逻辑推理合理的假设。更具体地说，我们将自适应逻辑转换为基于推理的论证，将ASPIC+、ASPIC+转换为基于推理的论证，将基于推理的论证的一个片段转换为自适应逻辑。自适应逻辑与梅金森的默认假设密切相关，并且与KLM和Shoham的偏好语义传统中的一类重要系统密切相关。因此，我们的研究结果也提供了正式的论证和后者的方法之间的密切联系。

2016-04-01cs.AIcs.LO

面向讨论与论证推理的带等词一阶逻辑的讨论图语义

Discussion Graph Semantics of First-Order Logic with Equality for Reasoning about Discussion and Argumentation

Department of Informatics, Kyoto University, Japan（信息学系，京都大学，日本）

本文针对现有AI论证推理缺乏通用形式框架的问题，提出带等词一阶逻辑的讨论图语义，推广Dung外延概念并证明其相关可刻画性结论。

2025-11-13cs.AIcs.LO

更多相关论文收起更多论文

超越用于法律推理的逻辑编程

Beyond Logic Programming for Legal Reasoning

本文探讨了利用深度学习技术改进基于PROLEG框架的法律推理，提出了四种方案并评估其技术可行性与可解释性，为构建法律决策支持系统提供指导。

2023-06-29cs.LO

最先进的法律推理模型在多大程度上支持溯因推理？

How well do SOTA legal reasoning models support abductive reasoning?

研究考察了SOTA法律推理模型对溯因推理的支持能力，构建了含498,697样本的逻辑增强数据集进行评估，发现这些模型虽擅长法律文本处理，但在溯因推理任务上仍显不足。

2023-06-29cs.LO

基于对话的逻辑推理结构化论证解释

Dialogue-based Explanations for Logical Reasoning using Structured Argumentation

Vrije University Amsterdam（阿姆斯特丹自由大学）

针对知识库容错推理解释缺乏关键信息、非二元冲突表达不足的问题，本文提出基于论证的通用方法，将最大一致子集推理逻辑转化为论证，通过对话模型生成更具表达性和直观性的辩证证明树解释查询答案。

2025-02-16cs.AIcs.DBcs.HC

Abduction and Argumentation for Explainable Machine Learning: A Position Survey

University of Cyprus（塞浦路斯大学）；Open University of Cyprus（塞浦路斯开放大学）

This paper presents Abduction and Argumentation as two principled forms for reasoning, and fleshes out the fundamental role that they can play within Machine Learning. It reviews the state-of-the-art work over the past few decades on the link of these two reasoning forms with machine learning work, and from this it elaborates on how the explanation-generating role of Abduction and Argumentation makes them naturally-fitting mechanisms for the development of Explainable Machine Learning and AI systems. Abduction contributes towards this goal by facilitating learning through the transformation, p…

2020-10-24cs.AIcs.LGcs.LO

无限论证框架的 grounded 语义复杂性分析

On the Complexity of the Grounded Semantics for Infinite Argumentation Frameworks

Department of Mathematics University of Wisconsin-Madison（威斯康星大学麦迪逊分校数学系）；Dipartimento di Ricerca e Innovazione Umanistica University of Bari, Italy（巴里大学人文研究与创新系）

本文研究了无限论证框架中 grounded 语义的复杂性，发现其计算难度极高，与有限情况下的多项式时间计算形成鲜明对比。

2025-11-27cs.AIcs.LO

Modelling Value-oriented Legal Reasoning in LogiKEy

University of Bamberg（班贝格大学）；Freie Universität Berlin（柏林自由大学）；Université du Luxembourg（卢森堡大学）

The logico-pluralist LogiKEy knowledge engineering methodology and framework is applied to the modelling of a theory of legal balancing in which legal knowledge (cases and laws) is encoded by utilising context-dependent value preferences. The theory obtained is then used to formalise, automatically evaluate, and reconstruct illustrative property law cases (involving appropriation of wild animals) within the Isabelle proof assistant system, illustrating how LogiKEy can harness interactive and automated theorem proving technology to provide a testbed for the development and formal verification o…

2022-03-30cs.AIcs.LO

Enabling Reasoning with LegalRuleML

Data61 CSIRO Australia（澳大利亚联邦科学与工业研究组织数据61中心）

In order to automate verification process, regulatory rules written in natural language need to be translated into a format that machines can understand. However, none of the existing formalisms can fully represent the elements that appear in legal norms. For instance, most of these formalisms do not provide features to capture the behavior of deontic effects, which is an important aspect in automated compliance checking. This paper presents an approach for transforming legal norms represented using LegalRuleML to a variant of Modal Defeasible Logic (and vice versa) such that a legal statement…

2018-04-07cs.AIcs.LO

一个基于论证的网络战归因分析框架

An Argumentation-Based Framework to Address the Attribution Problem in Cyber-Warfare

U.S. Military Academy（美国军事学院）；University of Oxford（牛津大学）；University of Liverpool（利物浦大学）；CONICET（国家科学和技术研究委员会）

通过使用多项技术证据（即，恶意软件逆向工程和源跟踪）和常规情报源（即，人或信号情报）是一个困难的问题，这不仅是因为需要努力获得证据，而且对手可以轻易地植入虚假证据。在本文中，我们介绍了一个正式的推理系统称为InCA（智能网络归因）框架，旨在帮助分析师在网络操作的归属，即使当可用的信息是冲突和/或不确定的。我们的方法结合了基于论证的推理，逻辑编程和概率模型，不仅属性的操作，但也解释了分析师为什么系统达到其结论。

2014-04-27cs.AIcs.CRcs.LO

通过ASP学习勇敢假设式论证框架

Learning Brave Assumption-Based Argumentation Frameworks via ASP

CNR-IASI（意大利国家研究委员会信息系统与信息学研究所）；Imperial（帝国理工学院）

本文研究从背景知识和正负示例中自动化学习假设式论证框架，提出基于转换规则和答案集编程的勇敢推理算法，并与最先进的ILP系统比较。

2024-11-08cs.AIcs.LGcs.LO