Consistency Management of Normal Logic Program by Top-down Abductive Proof Procedure

Details Consistency Management of Normal Logic Program by Top-down Abductive Proof Procedure Consistency Management of Normal Logic Program by Top-down Abductive Proof Procedure

2000-03-05

arxiv.org/abs/cs/0003008v1

Computer Science

Artificial Intelligence

Scientific paper

This paper presents a method of computing a revision of a function-free normal logic program. If an added rule is inconsistent with a program, that is, if it leads to a situation such that no stable model exists for a new program, then deletion and addition of rules are performed to avoid inconsistency. We specify a revision by translating a normal logic program into an abductive logic program with abducibles to represent deletion and addition of rules. To compute such deletion and addition, we propose an adaptation of our top-down abductive proof procedure to compute a relevant abducibles to an added rule. We compute a minimally revised program, by choosing a minimal set of abducibles among all the sets of abducibles computed by a top-down proof procedure.

Affiliated with

Also associated with

No associations

Rating

Consistency Management of Normal Logic Program by Top-down Abductive Proof Procedure does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Consistency Management of Normal Logic Program by Top-down Abductive Proof Procedure, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Consistency Management of Normal Logic Program by Top-down Abductive Proof Procedure will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-55243