改进逻辑程序分割方法，提升实际程序求解效率与正确性验证能力。
Splitting Answer Set Programs with respect to Intensionality Statements (Extended Version)
- 基于谓词、参数及上下文关系定义新分割条件
- 可处理以往方法无法适用的实用程序
- 适合逻辑编程求解器开发者与形式化验证研究者
分割逻辑程序可将计算其稳定模型的任务，简化为对其子程序的类似任务。该方法可用于提升求解性能并证明程序正确性。本文通过考虑谓词间依赖关系、参数及上下文信息，推广了可分割的条件，使以往不适用的常用程序得以分割。该方法显著扩展了实际应用场景的覆盖范围。
原文摘要 · Abstract (English)
Splitting a logic program allows us to reduce the task of computing its stable models to similar tasks for its subprograms. This can be used to increase solving performance and prove program correctness. We generalize the conditions under which this technique is applicable, by considering not only dependencies between predicates but also their arguments and context. This allows splitting programs commonly used in practice to which previous results were not applicable.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。