论文标题
拆分混合ASP程序
Splitting a Hybrid ASP Program
论文作者
论文摘要
混合答案集编程（Hybrid ASP）是答案集编程（ASP）的扩展，该编程（ASP）允许类似ASP的规则与外部来源进行交互。分裂集定理是ASP的重要且广泛使用的结果。本文介绍了用于混合ASP的混合ASP的拆分集定理，该定理是混合ASP等效的分裂集定理，并显示了如何将其应用于Hybrid ASP程序的简化计算答案集，用于与实际应用最相关的混合ASP程序。
Hybrid Answer Set Programming (Hybrid ASP) is an extension of Answer Set Programming (ASP) that allows ASP-like rules to interact with outside sources. The Splitting Set Theorem is an important and extensively used result for ASP. The paper introduces the Splitting Set Theorem for Hybrid ASP, which is for Hybrid ASP the equivalent of the Splitting Set Theorem, and shows how it can be applied to simplify computing answer sets for Hybrid ASP programs most relevant for practical applications.
