Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

Constraint programming is well suited for the computational modeling of music theories and
composition: its declarative and modular approach shares similarities with the way music …

Yet Another Prolog (YAP) is a Prolog system originally developed in the mid-eighties and
that has been under almost constant development since then. This paper presents the …

Web services run in complex contexts where arising events may compromise the quality of
the whole system. Thus, it is desirable to count on autonomic mechanisms to guide the self …

Mobile applications require dynamic reconfiguration services (DRS) to self-adapt their
behavior to the context changes (eg, scarcity of resources). Dynamic Software Product Lines …

In the context of Industry 4.0, the design of efficient Material Handling Systems (MHS) plays
a critical role in optimizing industrial operations and enhancing productivity. The integration …

We present a new constraint solver over finite domains, freely available as library (clpfd) in
SWI-Prolog. Our solver has several unique features, which we describe in this paper …

Publisher Summary This chapter focuses on the propagation-based finite domain constraint
programming systems—that is, systems that solve problems using constraint propagation …

In mass customization industries, such as car manufacturing, configurators play an important
role both to interact with customers and in engineering processes. This is particularly true …

Drawing from an analogy between features based Product Line (PL) models and Constraint
Programming (CP), this paper explores the use of CP in the Domain Engineering and …