Deontic Answer Set Programming (ASP)

The core mechanism of Deontic ASP is the computation of stable models (answer sets). Each stable model represents a distinct, logically coherent world that satisfies all encoded rules. In a deontic context, a stable model corresponds to a maximally consistent set of obligations and facts. If a scenario generates multiple stable models, it indicates the existence of multiple valid normative interpretations or unresolved conflicts, providing a transparent audit trail for legal reasoning.

A critical advantage of Deontic ASP is its native ability to handle Contrary-to-Duty (CTD) obligations without generating logical paradoxes. Unlike Standard Deontic Logic, which collapses under scenarios like Chisholm's Paradox, ASP uses default negation (not) and weak constraints to elegantly model fallback rules.

• Primary Rule: You ought not to cause damage.
• CTD Rule: If you cause damage, you ought to report it. ASP correctly yields a stable model where the reporting obligation is active precisely because the primary prohibition was violated.

Legal systems are inherently defeasible—conclusions can be withdrawn in light of new evidence or higher-priority rules. Deontic ASP is a non-monotonic formalism, meaning adding new information can shrink the set of valid conclusions. This is implemented through:

• Default negation: A rule applies only if its contrary is not provable.
• Weak constraints: Penalize certain outcomes to minimize violations, effectively encoding preference hierarchies like lex superior (higher law prevails) or lex specialis (specific law prevails).

Deontic ASP separates the representation of knowledge from the reasoning procedure. The user declares what the norms are, not how to compute them. This declarative approach allows a single set of rules to be queried for multiple purposes:

• Compliance Checking: Is a given action sequence compliant?
• Planning: What actions can an agent take to remain compliant?
• Explanation: Why is a specific obligation active or violated? This drastically reduces the engineering complexity of building normative reasoning engines.

Deontic ASP can formally model the complex jural relations identified in Hohfeldian Analysis. The framework moves beyond simple obligation/permission to represent:

• Power: The capacity to alter a legal relation.
• Liability: Being subject to another's power.
• Disability: The absence of power. By grounding these concepts in explicit predicates, ASP disambiguates complex legal positions, such as the distinction between a lack of permission and a lack of capacity, which is crucial for accurate contract analysis.

Static norms are insufficient for real-world legal reasoning. Deontic ASP is often combined with the Deontic Event Calculus to track the lifecycle of obligations over time. This allows the system to reason about:

• Activation: When a contract signing triggers a duty.
• Fulfillment/Violation: When an action satisfies or breaches an obligation.
• Expiration: When a deadline passes and a duty terminates. This temporal extension enables automated monitoring of compliance in dynamic, event-driven systems.

The foundational semantics of ASP that define the valid solutions (answer sets) of a logic program. A stable model is a minimal set of literals that satisfies all rules and is justified by the program itself. In deontic ASP, each stable model represents a non-contradictory set of obligations that satisfies the encoded normative scenario. The Gelfond-Lifschitz reduct is the formal mechanism used to verify stability, ensuring that every derived obligation has a non-circular justification rooted in the facts of the case.

The operator not in ASP, representing negation as failure. Unlike classical negation (-), default negation allows reasoning about what is not known to be true. In deontic contexts, this is critical for modeling:

• Negative permissions: An action is permitted if it is not explicitly prohibited.
• Defeasible obligations: A duty holds unless an exception is known to apply.
• Closed-world assumption: The legal code is treated as a complete specification of what is regulated.

A soft constraint mechanism in ASP that expresses preferences rather than hard requirements. Unlike strong constraints (which eliminate answer sets), weak constraints assign penalty points to solutions that violate them. The optimal answer sets minimize total penalty. In deontic ASP, weak constraints model:

• Normative hierarchies: Preferring higher-authority norms.
• Lex specialis: Minimizing violations of specific rules over general ones.
• Contrary-to-duty optimization: Selecting the least non-compliant resolution path when full compliance is impossible.

ASP constructs using curly brace syntax {a; b; c} that allow the reasoner to non-deterministically include any subset of the listed atoms in an answer set. In deontic modeling, choice rules represent:

• Permissive norms: An agent may perform any of the listed actions.
• Discretionary powers: A judge may select from a range of applicable remedies.
• Multiple compliant states: Generating all possible sets of obligations that satisfy a regulatory framework, enabling exhaustive compliance analysis.

ASP's native ability to generate multiple answer sets makes it uniquely suited for identifying and resolving normative conflicts. When a legal scenario admits contradictory obligations, each answer set represents a distinct resolution strategy. The solver can be guided by:

• Preference rules: Encoding lex superior and lex specialis.
• Cardinality constraints: Limiting the number of violated norms.
• Disjunctive rules: Explicitly enumerating mutually exclusive compliance paths. This produces a complete landscape of legally defensible outcomes rather than a single brittle conclusion.