论文标题
自动化法律理由
Automating Defeasible Reasoning in Law
论文作者
论文摘要
论文研究基于规则的系统，尤其是有关法律规范和合同的不依据推理。我们确定规则修饰符，以指定规则如何相互作用以及如何覆盖它们。然后，我们定义了消除这些修饰符的规则转换，最终导致规则转换为公式。为了与规则进行推理，我们将两种方法与SMT求解器作为证明引擎进行了对比，一种在经典逻辑中，一种在非单调逻辑中，一种与答案集编程求解器。
The paper studies defeasible reasoning in rule-based systems, in particular about legal norms and contracts. We identify rule modifiers that specify how rules interact and how they can be overridden. We then define rule transformations that eliminate these modifiers, leading in the end to a translation of rules to formulas. For reasoning with and about rules, we contrast two approaches, one in a classical logic with SMT solvers as proof engines, one in a non-monotonic logic with Answer Set Programming solvers.
