570 search results - page 1 / 114 » The Complexity of Reasoning with Global Constraints |
CONSTRAINTS
2007
13 years 4 months ago
2007
AAAI
2004
13 years 6 months ago
2004
We study the computational complexity of reasoning with global constraints. We show that reasoning with such constraints is intractable in general. We then demonstrate how the sam...
LICS
2009
IEEE
13 years 11 months ago
2009
IEEE
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...
ASE
1998
13 years 4 months ago
1998
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
AAAI
2008
13 years 7 months ago
2008
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propag...