The rise of powerful AI technology for a range of applications that are sensitive to legal, social, and ethical norms demands decision-making support in presence of norms and regulations. Normative reasoning is the realm of deontic logics, that are challenged by well-known benchmark problems (deontic paradoxes), and lack efficient computational tools. In this paper, we use Answer Set Programming (ASP) for addressing these shortcomings and showcase how to encode and resolve several well-known deontic paradoxes utilizing weak constraints. By abstracting and generalizing this encoding, we present a methodology for translating normative systems in ASP with weak constraints. This methodology is applied to "ethical" versions of Pac-man, where we obtain a comparable performance with related works, but ethically preferable results.

翻译：强大的人工智能技术日益应用于法律、社会及伦理规范敏感的领域，这要求我们在规范与规则存在的情况下获得决策支持。规范性推理属于道义逻辑的范畴，但道义逻辑面临已知基准问题（道义悖论）的挑战，且缺乏高效的计算工具。本文采用答案集编程（ASP）来应对这些不足，并展示如何利用弱约束对若干已知的道义悖论进行编码与求解。通过抽象和泛化这一编码方式，我们提出了一种在ASP中借助弱约束转换规范系统的方法。该方法被应用于"伦理版"吃豆人游戏，在获得与相关工作可比较性能的同时，实现了更符合伦理的结果。