Splitting a Hybrid ASP Program

Hybrid Answer Set Programming (Hybrid ASP) is an extension of Answer Set Programming (ASP) that allows ASPlike 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. An important result for logic programs is the Splitting Set Theorem [12], which shows how computing an answer set for a program can be broken into several tasks of the same kind for smaller programs. The theorem and its more general variant the Splitting Sequence Theorem are extensively used for proving other theorems, for instance in [1], [9] or [3] among many others. Hybrid Answer Set Programming (Hybrid ASP) [4] is an extension of ASP that allows ASPlike rules to interact with outside sources, which makes Hybrid ASP well suited for practical applications.