1300 search results - page 28 / 260 » Constraint satisfaction problems and global cardinality cons... |
COCO
2004
Springer
15 years 3 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...
ICTAI
2008
IEEE
15 years 4 months ago
2008
IEEE
Constraint programming has been used in many applications where uncertainty arises to model safe reasoning. The goal of constraint propagation is to propagate intervals of uncerta...
LICS
2007
IEEE
15 years 4 months ago
2007
IEEE
We introduce symmetric Datalog, a syntactic restriction of linear Datalog and show that its expressive power is exactly that of restricted symmetric monotone Krom SNP. The deep re...
GLOBECOM
2009
IEEE
15 years 4 months ago
2009
IEEE
— The dynamic composition of systems of networked appliances, or virtual devices, enables users to generate complex strong specific systems. Current prominent MANET-based composi...
75
Voted
SETN
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Constructive methods obtain solutions to constraint satisfaction problem instances by iteratively extending consistent partial assignments. In this research, we study the...