deon- \(\mathcal {B}\) : A Language for Well-Founded Deontic Planning
摘要
Declarative languages are widely used for reasoning about actions and planning, with semantics and extensions to cater for different needs. We introduce the rule-based action language deon-B, which builds on an extension of the well-founded semantics by incorporating deontic operators, allowing one to reason about obligations, prohibitions, and permissions in a non-monotonic setting. To further enhance its applicability in dynamic environments, we integrate a mechanism for action choice inspired by answer set-based action languages, enabling reasoning about transitions between states and for expressing the evolution of normative goals. Our approach provides a computationally efficient approximation of answer-set-based deontic reasoning while preserving key expressiveness. We evaluate the proposed formalism against well-known deontic challenges such as contrary-to-duty obligations and the distinction between prima facie and actual obligations, demonstrating its ability to capture and resolve normative conflicts within dynamic domains.