4524 search results - page 170 / 905 » The Complexity of Global Constraints |
102
Voted
LICS
1999
IEEE
15 years 5 months ago
1999
IEEE
The complexity of set constraints has been extensively studied over the last years and was often found quite high. At the lower end of expressiveness, there are atomic set constra...
123
Voted
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
79
Voted
JANCL
2006
15 years 24 days ago
2006
We present an overview of linear-time temporal logics with Presburger constraints whose models are sequences of tuples of integers. Such formal specification languages are welldesi...
102
Voted
DISOPT
2007
15 years 24 days ago
2007
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation....
83
Voted
AMAI
2004
Springer
15 years 6 months ago
2004
Springer
In reasoning tasks involving logical formulas, high expressiveness is desirable, although it often leads to high computational complexity. We study a simple measure of expressiven...