An ASP semantics for Constraints involving Conditional Aggregates

by   Pedro Cabalar, et al.

We elaborate upon the formal foundations of hybrid Answer Set Programming (ASP) and extend its underlying logical framework with aggregate functions over constraint values and variables. This is achieved by introducing the construct of conditional expressions, which allow for considering two alternatives while evaluating constraints. Which alternative is considered is interpretation-dependent and chosen according to an associated condition. We put some emphasis on logic programs with linear constraints and show how common ASP aggregates can be regarded as particular cases of so-called conditional linear constraints. Finally, we introduce a polynomial-size, modular and faithful translation from our framework into regular (condition-free) Constraint ASP, outlining an implementation of conditional aggregates on top of existing hybrid ASP solvers.


page 1

page 2

page 3

page 4


Splitting a Hybrid ASP Program

Hybrid Answer Set Programming (Hybrid ASP) is an extension of Answer Set...

Constraint Answer Set Programming without Grounding

Extending ASP with constraints (CASP) enhances its expressiveness and pe...

A Uniform Treatment of Aggregates and Constraints in Hybrid ASP

Characterizing hybrid ASP solving in a generic way is difficult since on...

Hybrid Conditional Planning using Answer Set Programming

We introduce a parallel offline algorithm for computing hybrid condition...

Towards a Semantics for Hybrid ASP systems

Over the last decades the development of ASP has brought about an expres...

Clingo goes Linear Constraints over Reals and Integers

The recent series 5 of the ASP system clingo provides generic means to e...

exp(ASPc) : Explaining ASP Programs with Choice Atoms and Constraint Rules

We present an enhancement of exp(ASP), a system that generates explanati...