106 search results - page 13 / 22 » Weighted Constraint Satisfaction with Set Variables |
CPAIOR
2004
Springer
14 years 13 days ago
2004
Springer
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
MST
2008
13 years 8 months ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
CP
2006
Springer
14 years 13 days ago
2006
Springer
We reconsider the idea of structural symmetry breaking (SSB) for constraint satisfaction problems (CSPs). We show that the dynamic dominance checks used in symmetry breaking by dom...
TPLP
2008
13 years 8 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 ...
CP
2008
Springer
13 years 10 months ago
2008
Springer
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...