Ciabattoni, A., Eiter, T., & Hatschka, C. (2023). Deontic Paradoxes in ASP with Weak Constraints. In Proceedings 39th International Conference on Logic Programming (pp. 367–380).
E192-05 - Forschungsbereich Theory and Logic E192-03 - Forschungsbereich Knowledge Based Systems E056-13 - Fachbereich LogiCS E192-01 - Forschungsbereich Algorithms and Complexity
-
Published in:
Proceedings 39th International Conference on Logic Programming
The 39th International Conference on Logic Programming, ICLP 2023
en
Event date:
9-Jul-2023 - 15-Jul-2023
-
Event place:
London, United Kingdom of Great Britain and Northern Ireland (the)
-
Number of Pages:
14
-
Peer reviewed:
Yes
-
Keywords:
Deontic Logic; Answer Set Programming; DLV
en
Abstract:
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.
en
Project title:
Training and Guiding AI Agents with Ethical Rules: ICT22-023 (WWTF Wiener Wissenschafts-, Forschu und Technologiefonds)
