Relativized hyperequivalence of logic programs for modular programming

Details Relativized hyperequivalence of logic programs for modular programming Relativized hyperequivalence of logic programs for modular programming

2009-07-23

arxiv.org/abs/0907.4128v1

Computer Science

Artificial Intelligence

Scientific paper

A recent framework of relativized hyperequivalence of programs offers a unifying generalization of strong and uniform equivalence. It seems to be especially well suited for applications in program optimization and modular programming due to its flexibility that allows us to restrict, independently of each other, the head and body alphabets in context programs. We study relativized hyperequivalence for the three semantics of logic programs given by stable, supported and supported minimal models. For each semantics, we identify four types of contexts, depending on whether the head and body alphabets are given directly or as the complement of a given set. Hyperequivalence relative to contexts where the head and body alphabets are specified directly has been studied before. In this paper, we establish the complexity of deciding relativized hyperequivalence with respect to the three other types of context programs. To appear in Theory and Practice of Logic Programming (TPLP).

Affiliated with

Also associated with

No associations

Rating

Relativized hyperequivalence of logic programs for modular programming 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 Relativized hyperequivalence of logic programs for modular programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Relativized hyperequivalence of logic programs for modular programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-355424