138 search results - page 1 / 28 » Domain Transmutation in Constraint Satisfaction Problems |
AAAI
2004
13 years 6 months ago
2004
We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of &quo...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ...
DAGSTUHL
2008
13 years 6 months ago
2008
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
JAIR
2010
13 years 3 months ago
2010
Diagrammatic reasoning (DR) is pervasive in human problem solving as a powerful adjunct to symbolic reasoning based on language-like representations. The research reported in this...