Normative Collision Matrix

The matrix exhaustively enumerates all pairwise combinations of deontic operators. Each cell represents a specific collision type, such as Obligation vs. Prohibition or Permission vs. Obligation. This structured approach ensures that no potential normative contradiction is left unaddressed, providing a complete conflict detection surface. The system maps inputs like O(p) ∧ F(p) to a resolution function, where O is obligation and F is prohibition.

Each cell in the matrix is populated with a deterministic resolution function, not a probabilistic guess. These functions encode legal maxims directly:

• Lex Specialis: The more specific rule prevails.
• Lex Superior: The higher-authority rule prevails.
• Lex Posterior: The later-enacted rule prevails. This transforms abstract legal principles into executable, auditable code paths.

Beyond binary resolution, advanced matrices assign a conflict severity score to each collision. A direct Obligation-Prohibition conflict receives a higher severity weight than a Permission-Permission overlap. This scoring allows the reasoning engine to prioritize the resolution of critical contradictions that could lead to legal non-compliance, optimizing computational resources for high-risk conflicts.

The matrix implements defeasible reasoning by carving exceptions rather than nullifying rules entirely. When a general obligation collides with a specific prohibition, the resolution function does not delete the obligation. Instead, it generates a scoped exception: O(p) ∧ F(p) → O(p) except in context C. This preserves the integrity of the broader normative system while resolving the local conflict.

The collision matrix does not operate in isolation. It queries a Normative Hierarchy Graph—a directed acyclic graph encoding precedence based on authority, specificity, and temporality. When a collision is detected, the matrix traverses this graph to determine which rule holds superior binding strength before applying the resolution function, ensuring hierarchical consistency.

When multiple rules collide, the matrix can invoke a Maximal Consistent Subset (MCS) algorithm. This computational method identifies the largest non-contradictory subset of rules from an inconsistent rule base. For example, given conflicting obligations from three statutes, the MCS function returns the two that can coexist without contradiction, providing a conflict-free reasoning foundation.