Stable Legal Knowledge with Regard to Contradictory Arguments

In this paper, we pay attention to the logical representation of codes. Then, the problem of detecting inconsistency becomes different from the conventional belief revision. Suppose the following pair of rules. ∆ = {α → β, α → ¬β} Note that ∆ is not inconsistent unless a fact α is supplied. Because the logical consequence of ∆ together with α produces both of β and ¬β, ∆ ∪ {α} ` {β,¬β}. Our motivation in this paper is to propose a method to detect such latent inconsistency of codes, that is superficially consistent in the logical point of view, supplying a minimal set of facts.