Relativized Hyperequivalence of Logic Programs for Modular Programming

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 pro,, due to its flexibility that allows us to restrict. independently of cacti 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 its 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 wrt the three other types of context programs.