模块化程序设计中逻辑程序的相对化超等价性
Relativized hyperequivalence of logic programs for modular programming
摘要：
最近的框架相对化hyperequivalence的程序提供了一个统一的推广强和一致的等价。它似乎特别适合于程序优化和模块化编程中的应用，因为它的灵活性允许我们在上下文程序中相互独立地限制头部和主体字母表。本文研究了逻辑程序的稳定、支持和支持最小模型的三种语义的相对化超等价性。对于每一种语义，我们确定四种类型的上下文，这取决于头部和身体字母是直接给出的还是作为给定集合的补充。超等价相对于上下文的头部和身体字母直接指定已经研究过。在本文中，我们建立了相对于其他三种类型的上下文程序决定相对化超等价的复杂性。逻辑程序设计理论与实践（Theory and Practice of Logic Programming，TPLP）
英文摘要：
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).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
