arXiv:2505.01944cs.LOcs.AI2025-05被引 2

用可解释逻辑构建法律编码方法,实测可预测编码耗时。

Explainability by design: an experimental analysis of the legal coding process

  • 从法律文本出发,通过情景测试生成可解释的规则
  • 实验显示编码时间与文本长度和引用深度正相关
  • 适合法律科技、合规系统开发人员参考

在道义可废止逻辑中,规范背景片段的映射过程从文本转化为规则,并隐含了对编码片段的解释。本文提出一种法律编码方法,从片段出发,经由一系列情景测试,生成道义可废止逻辑规则。该方法以一个示例文本的编码过程加以说明。随后,我们通过人类参与的多组实验,测量了不同规范背景及其案例的编码努力程度,分析其与可度量特征的关系。实验采用最新技术Houdini进行道义可废止逻辑推理。最后,提出一种预测编码所需时间的技术,该技术依赖于法律领域知识、编码流程知识、文本长度以及反映法律引用路径长度的“深度”指标。

原文摘要 · Abstract (English)

Behind a set of rules in Deontic Defeasible Logic, there is a mapping process of normative background fragments. This process goes from text to rules and implicitly encompasses an explanation of the coded fragments. In this paper we deliver a methodology for \textit{legal coding} that starts with a fragment and goes onto a set of Deontic Defeasible Logic rules, involving a set of \textit{scenarios} to test the correctness of the coded fragments. The methodology is illustrated by the coding process of an example text. We then show the results of a series of experiments conducted with humans encoding a variety of normative backgrounds and corresponding cases in which we have measured the efforts made in the coding process, as related to some measurable features. To process these examples, a recently developed technology, Houdini, that allows reasoning in Deontic Defeasible Logic, has been employed. Finally we provide a technique to forecast time required in coding, that depends on factors such as knowledge of the legal domain, knowledge of the coding processes, length of the text, and a measure of \textit{depth} that refers to the length of the paths of legal references.

法律人工智能可解释性逻辑编码

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。