Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
: This report introduces a geometrical constraint kernel for handling the location in space and time of polymorphic k-dimensional objects subject to various geometrical and time co...
Nicolas Beldiceanu, Mats Carlsson, Emmanuel Poder,...
We put forward a methodological approach aimed at guiding ontology modellers in choosing which relations to reify. Our proposal is based on the notion of aggregation as used in con...
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chem...
Sandra de Amo, Nyara A. Silva, Ronaldo P. Silva, F...
, reproductive value, soft selectionAbstract Structural complexity characterizes our representations of dissipative structures. As a mechanistic concept, when referred to natural s...