Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ...
We show that global constraints on finite domains like alldifferent can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reform...
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks relat...