Characterising the Complexity of Constraint Satisfaction Problems Defined by 2-Constraint Forbidden Patterns

Given the radical claim that productivity sets the dividing line between a pattern of coining and a construction in BCG, productivity measures should be used to confirm

• Show that the Bose symmetry of the photon imposes a constraint on the wave function. • Find the condition on the wave function in order to have a

Many known classes of tractable problems and polynomial-time algorithms can be directly linked to the fact that a valued constraint language has some particular multimorphism..

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

The template instance pattern proposes a way of reducing the number of reified instances and the related property assertion axioms in an ontology, especially for the cases in which

Thus semantic connection should replace semantic value as the principal object of semantic enquiry; and just as the semantic evaluation of a complex expression is naturally taken

Curiously, al- most all CSP-like problems studied in the literature turn out to be either a priori or a posteriori compatible with polymorphisms, and only a handful of concrete

A direct approach would be to com- pute a concise representation for each measure m ∈ M , but this is generally not possible because some measures, such as area or length, are