Splitting a Hybrid ASP Program

Hybrid Answer Set Programming (H-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 introduce the Splitting Set Theorem for Hybrid ASP, which is for H-ASP the equivalent of the Splitting Set Theorem, and shows how it can be applied to simplify computing answer sets for H-ASP programs most relevant for practical applications.

• Machine Intelligence

• Algorithms and Theory