Soft constraints based on semirings are a generalization of classical constraints, where tuples of variables' values in each soft constraint are uniquely associated to element...
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Camera control techniques for Interactive Digital Entertainment (IDE) are reaching their limits in terms of capabilities. To enable future growth, new methods must be derived to a...