Summary: An efficient scheme for maintaining minimal knowledge in the presence of a permutation dependency is presented. Because this scheme eliminates the redundancy in the initial value of the recursive predicate, the cost of query processing is reduced by a constant factor. Thus, the method improves over other conventional methods both in space and time. We also present an optimization strategy based upon identification and removal the redundant rules from a datalog program.