15 search results - page 2 / 3 » Propagating Conjunctions of AllDifferent Constraints |
COR
2006
13 years 4 months ago
2006
This paper presents a new generic filtering algorithm which simultaneously considers n conjunctions of constraints as well as those constraints mentioning some variables Yk of the...
PPDP
2001
Springer
13 years 9 months ago
2001
Springer
This paper explores the question of when two propagationbased constraint systems have the same behaviour, in terms of search space. We categorise the behaviour of domain and bound...
CP
2005
Springer
13 years 10 months ago
2005
Springer
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at...
CP
2009
Springer
14 years 5 months ago
2009
Springer
We investigate the global GRAMMAR constraint over restricted classes of context free grammars like deterministic and unambiguous context-free grammars. We show that detecting disen...
ITC
2003
IEEE
13 years 10 months ago
2003
IEEE
Functional verification of complex designs largely relies on the use of simulation in conjunction high-level verification languages (HVL) and test-bench automation (TBA) tools. In...