Reasoning by dominance in not-equals binary constraint networks

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

Volumn 4204 LNCS, Issue , 2006, Pages 670-674

  Benhamou, Belaïd ^a   Saïdi, Mohamed Réda ^a  

^a UNIVERSITÉ DE PROVENCE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; COMPUTER NETWORKS; CONSTRAINT THEORY; FAULT TREE ANALYSIS; TREES (MATHEMATICS);

CONSTRAINT NETWORKS; PRINCIPLE OF SYMMETRY; SEARCH TREE;

FORMAL LOGIC;

EID: 33750342004     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889205_48     Document Type: Conference Paper

References (12)

1. Krishnamurty, B.: Short proofs for tricky formulas. Acta informatica (22) (1985) 253-275
2. Benhamou, B., Sais, L.: Theoretical study of symmetries in propositional calculus and application. CADE-11, Saratoga Springs, NY, USA (1992)
3. Puget, J.F.: On the satisfiability of symmetrical constrained satisfaction problems. In: ISMIS. (1993)
4. Benhamou, B.: Study of symmetry in constraint satisfaction problems. In PPCP'94 (1994)
5. Puget, J.F.: Breaking symmetries in all different problems. In, proceedings of IJCAI (2005) 272-277
6. Puget, J.F.: Breaking all value symmetries in surjection problems. In, proceedings of CP (2005) 490-504
7. Cohen, D., Jeavons, P., Jefferson, C., Petrie, K., Smith, B.: Symmetry definitions for constraint satisfaction problems. In, proceedings of CP (2005) 17-31
8. Freuder, E.: Eliminating interchangeable values in constraints satisfaction problems. Proc AAAI-91 (1991) 227-233
9. Benhamou, B.: Theoretical study of dominance in constraint satisfaction problems. 6th International Conference on Artificial Intelligence: Methodology, Systems and Applications (AIMSA-94), Sofia, Bulgaria, September (1994) 91-97
10. Benhamou, B., Saïdi, M.R.: Reasoning by dominance in not-equals binary constraint networks. Technical report, LSIS (www.lsis.org) (2006)
11. Benhamou, B.: Symmetry in not-equals binary constraint networks. SymCon'04: 4th International Workshop on Symmetry and Constraint Satisfaction Problems (2004)
12. Sewell, E.G.: An improved algorithm for exact graph coloring. DIMACS series on Discrete Mathematics and Theorical Computer Science (1995)