Minimal Revision of Logic Specification Using Extended Logic Programming: Preliminary Report

Ken Satoh

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).


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.