
Splitting a Hybrid ASP Program
Hybrid Answer Set Programming (Hybrid ASP) is an extension of Answer Set...
read it

A Uniform Treatment of Aggregates and Constraints in Hybrid ASP
Characterizing hybrid ASP solving in a generic way is difficult since on...
read it

Constraint Answer Set Programming without Grounding
Extending ASP with constraints (CASP) enhances its expressiveness and pe...
read it

Hybrid Conditional Planning using Answer Set Programming
We introduce a parallel offline algorithm for computing hybrid condition...
read it

Implementing Dynamic Answer Set Programming
We introduce an implementation of an extension of Answer Set Programming...
read it

Clingo goes Linear Constraints over Reals and Integers
The recent series 5 of the ASP system clingo provides generic means to e...
read it

Unfounded Sets for Disjunctive Hybrid MKNF Knowledge Bases
Combining the closedworld reasoning of answer set programming (ASP) wit...
read it
An ASP semantics for Constraints involving Conditional Aggregates
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 interpretationdependent 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 socalled conditional linear constraints. Finally, we introduce a polynomialsize, modular and faithful translation from our framework into regular (conditionfree) Constraint ASP, outlining an implementation of conditional aggregates on top of existing hybrid ASP solvers.
READ FULL TEXT
Comments
There are no comments yet.