239 search results - page 3 / 48 » The Parameterized Complexity of Global Constraints |
AAAI
2004
13 years 9 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...
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
CSCLP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We propose a new family of constraints which combine together lexicographical ordering constraints for symmetry breaking with other common global constraints. We give a g...
CIE
2008
Springer
13 years 7 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...