749 search results - page 94 / 150 » Dualities for Constraint Satisfaction Problems |
73
Voted
ICRA
2005
IEEE
15 years 4 months ago
2005
IEEE
— This paper presents a method to determine whether an assembly of planar parts will stay assembled as it is pushed over a support surface. For a given pushing motion, an assembl...
83
Voted
TPLP
2008
14 years 11 months ago
2008
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
CONSTRAINTS
2010
14 years 11 months ago
2010
Abstract. We present three constraint models of the problem of finding a graceful labelling of a graph, or proving that the graph is not graceful. An experimental comparison of the...
ECAI
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one formulation of a CSP may enable a solver to solve it quickly, a different ...
104
click to vote
AI
2008
Springer
14 years 11 months ago
2008
Springer
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency...