1378 search results - page 17 / 276 » The Tractability of Global Constraints |
CPAIOR
2009
Springer
15 years 6 months ago
2009
Springer
Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint pro...
COCO
2004
Springer
15 years 5 months ago
2004
Springer
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
LICS
2009
IEEE
15 years 6 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 ...
AAAI
1994
15 years 1 months ago
1994
We propose a propositional language for temporal reasoning that is computationally effective yet expressive enough to describe information about fluents, events and temporal const...