1300 search results - page 65 / 260 » Constraint satisfaction problems and global cardinality cons... |
152
click to vote
SARA
2007
Springer
16 years 8 days ago
2007
Springer
In order to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction problem. There are typically many alternative mode...
165
click to vote
ACL
1990
15 years 7 months ago
1990
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
158
click to vote
CIE
2009
Springer
16 years 22 days ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
149
click to vote
SIAMCOMP
2010
15 years 27 days ago
2010
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We ...
150
click to vote
CP
2004
Springer
15 years 10 months ago
2004
Springer
This paper presents an algorithm that achieves hyper-arc consistency for the soft alldifferent constraint. To this end, we prove and exploit the equivalence with a minimum-cost flo...