Splitting a Hybrid ASP Program

09/22/2020
by   Alex Brik, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

03/15/2012

Possibilistic Answer Set Programming Revisited

Possibilistic answer set programming (PASP) extends answer set programmi...
09/17/2021

How to Split a Logic Program

Answer Set Programming (ASP) is a successful method for solving a range ...
02/17/2020

An ASP semantics for Constraints involving Conditional Aggregates

We elaborate upon the formal foundations of hybrid Answer Set Programmin...
01/14/2022

Specifying and Reasoning about CPS through the Lens of the NIST CPS Framework

This paper introduces a formal definition of a Cyber-Physical System (CP...
09/22/2020

An application of Answer Set Programming in Distributed Architectures: ASP Microservices

We propose an approach to the definition of microservices with an Answer...
07/28/2011

Complex Optimization in Answer Set Programming

Preference handling and optimization are indispensable means for address...
12/03/2010

Using ASP with recent extensions for causal explanations

We examine the practicality for a user of using Answer Set Programming (...