Splitting a Hybrid ASP Program
This work addresses a foundational issue for researchers and practitioners in logic programming, though it is incremental as it extends an existing theorem to a new context.
The paper tackles the problem of computing answer sets in Hybrid Answer Set Programming (Hybrid ASP) by introducing a Splitting Set Theorem for this extension, which simplifies the process for practical applications.
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.