This paper presents a method of computing minimal revision of logical specification to handle inconsistencies. We have already proposed a formalization of minimal revision of logical specification (Satoh 1998) which is a modification of minimal revision in (Satoh 1988) and related the formalism with Formula Circumscription (McCarthy 1986). Moreover, we have proposed a computational method for a minimal revised logical specification without function symbols by abductive logic programming. However, the proposed computational method in (Satoh 1998) needs a minimality check of abducibles corresponding with revision in order to get a minimal revised specification. In this paper, we have proposed a method which directly computes a minimal revised specification. The technique is an adaptation of computational method of circumscription (Wakaki and Satoh 1997).