4117 search results - page 173 / 824 » On the Satisfiability of Complex Constraints |
167
click to vote
CPAIOR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
136
click to vote
JANCL
2006
15 years 6 months 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...
177
click to vote
DISOPT
2007
15 years 6 months ago
2007
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation....
149
click to vote
AMAI
2004
Springer
15 years 12 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...
182
click to vote
EPIA
1993
Springer
15 years 10 months ago
1993
Springer
Abstract. This work presents a constraint solver for the domain of rational trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in...