Splitting a Hybrid ASP Program

TL;DR

This paper extends the Splitting Set Theorem to Hybrid ASP, enabling simplified computation of answer sets by leveraging the theorem's application to hybrid programs involving external sources.

Contribution

It introduces the Splitting Set Theorem for Hybrid ASP, adapting a key ASP result to hybrid programs for improved practical answer set computation.

Findings

Theorem successfully extended to Hybrid ASP.

Simplifies answer set computation for hybrid programs.

Facilitates practical applications of Hybrid ASP.

Abstract

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.