Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
This paper presents a global constraint that enforces rules written in a language based on arithmetic and first-order logic to hold among a set of objects. In a first step, the rul...
Abstract. We present an integration of answer set programming and constraint processing as an interesting approach to constraint logic programming. Although our research is in a ve...
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...