239 search results - page 2 / 48 » The Parameterized Complexity of Global Constraints |
COCO
2004
Springer
13 years 10 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...
IWPEC
2010
Springer
13 years 2 months ago
2010
Springer
CAV
2007
Springer
13 years 8 months ago
2007
Springer
We present a simple and effective approximated backward reachability algorithm for parameterized systems with existentially and universally quantified global conditions. The indivi...
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 ...
FORTE
2009
13 years 2 months ago
2009
Abstract. We propose a verification method for parameterized systems with global conditions. The method is based on context-sensitive constraints, a symbolic representation of infi...