Hybrid set domains to strengthen constraint propagation and reduce symmetries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3258, Issue , 2004, Pages 604-618

  Sadler, Andrew ^a   Gervet, Carmen ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

ARBITRARY CONSTRAINTS; COMBINATORIAL DESIGN; CONSTRAINT PROPAGATION; DOMAIN REPRESENTATIONS; ERROR CORRECTING CODE; LEVEL OF CONSISTENCIES; SET CARDINALITY; SYMMETRY BREAKING CONSTRAINTS;

FINITE DIFFERENCE METHOD;

EID: 33947542507     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_44     Document Type: Article

References (19)

1. Colbourn, Dinitz, Stinson: Applications of combinatorial designs to communications, cryptography, and networking. In: Surveys in Combinatorics London Mathematical Society Lecture Note Series 187. Cambridge University Press (1999)
2. Gervet, C.: Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language. CONSTRAINTS journal 1(3) (1997) 191-244
3. Beldiceanu, N., Contejean, E.: Introducing Global Constraints in CHIP. In: Mathematical Computation Modelling. Volume 20(12). (1994)
4. Régin, J.C.: A filtering algorithm for constraints of difference in csps. In: Proc. AAAI-94. (1994)
5. Flener, P., Frisch, A., Hnich, B., Kiziltan, Z., Miguel, I., Pearson, J., Walsh, T.: Breaking row and column symmetries in matrix models. In: Proc. CP'02. LNCS, Springer (2002)
6. Gent, I.P., Prosser, P., Smith, B.M.: A 0/1 encoding of the gaclex for pairs of vectors. In: ECAI/W9 Modelling and Solving Problems with Constraints. (2002)
7. Mackworth, A.: On reading sketch maps. In: IJCAI'77. (1977) 598-606
8. Walsh, T.: Consistency and propagation with multiset constraints: A formal viewpoint. In: Proc. CP-2003. (2003)
9. Hall, P.: On Representatives of Subsets. J. of London Math. Soc. 10 (1935) 26-30
10. Régin, J.C.: Generalized arc consistency for global cardinality constraint. In: Proc. AAAI-96. (1996)
11. Sadler, A., Gervet, C.: Global filtering for the disjoint constraint on fixed cardinality sets. Technical Report IC-PARC-04-2, Imperial College, London (2004)
12. Sadler, A., Gervet, C.: Global reasoning on sets. In: FORMUL'01 workshop in conjunction with CP-01. (2001)
13. Puget, J.F.: A fast algorithm for the bound consistency of alldiff constraints. AAAI (1998)
14. Crawford, J., Ginsberg, M., Luks, E.M., Roy, A.: Symmetry breaking predicates for search problems. In: Fifth Int. Conf. on Knowledge Rep. and Reasoning. (1996)
15. Gervet, C.: Conjunto: constraint logic programming with finite set domains. In: Proc. ILPS-94. (1994)
16. Azevedo, F.: Cardinal: an extended set solver. Computational Logic (2000)
17. e. Technical Report 03-1, IC-Parc, Imperial College London (2003)
18. Müller, T., Müller, M.: Finite set constraints in Oz. In: 13. Workshop Logische Programmierung. (1997)
19. Hnich, B., Kiziltan, Z., Walsh, T.: Combining symmetry breaking with other constraints: lexicographic ordering with sums. In: Proc. SymCon. (2003)