The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
A novel method unifying viewer and model centered approaches for representing structurally complex 3-D objects like human faces is presented. The uni ed 3D frequency-domain repres...
The Goal Decomposition Tree model has been introduced in 2005 by Mermet et al. [9] to specify and verify the behaviour of an agent evolving in a dynamic environment. This model pr...
: The bene ts of the object, logic or relational, functional, and constraint paradigms can be obtained from our previous combination of the object and functional paradigms in hidde...
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...