We present the clp (FD) system: a constraint logic programming language with finite domain
constraints. We detail its implementation, and present an abstract instruction set for the …

The development of variable software, in general, and feature models, in particular, is an
error-prone and time-consuming task. It gets increasingly more challenging with industrial …

As today's most complex computing environment, the Internet confronts IT researchers,
system designers, and application developers with completely new challenges and, as a …

We study here a natural situation when constraint programming can be entirely reduced to
rule-based programming. To this end we explain first how one can compute on constraint …

Constraint programming is an alternative approach to programming in which the
programming process is limited to a generation of requirements (constraints) and a solution …

Product Lines (PL) have proved an effective approach to reuse-based systems
development. Several modeling languages were proposed so far to specify PL. Although …

Product lines (PL) modeling have proven to be an effective approach to reuse in software
development. Several variability approaches were developed to plan requirements reuse …

We study here the well-known propagation rules for Boolean constraints. First we propose a
simple notion of completeness for sets of such rules and establish a completeness result …

We present a new constraint solver over Boolean variables, available as library
(clpb)(documentation: http://eu. swi-prolog. org/man/clpb. html) in SWI-Prolog. Our solver …

In this paper, a Boolean algebra approach is proposed to encode various acceptability
semantics for abstract argumentation frameworks, where each semantics can be …