Maintaining dominance consistency

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

Volumn 2833, Issue , 2003, Pages 945-949

  Razgon, Igor ^a   Meisels, Amnon ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING;

DOMINANCE DETECTIONS; FORWARD CHECKING; LOCAL CONSISTENCY; SYMMETRY-BREAKING;

CONSTRAINT THEORY;

EID: 35248859161     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_84     Document Type: Article

References (5)

1. T. Fahle, S. Schamberger, and M. Sellmann. Symmetry breaking. In CP2001, pages 93-108. Springer, November 2001.
2. F. Focacci and M. Milano. Global cut framework for removing symmetries. In CP2001, pages 93-108. Springer, November 2001.
3. E.C. Freuder. Eliminating interchangeable values in constraint satisfaction prob lems. In AAAI 91, pages 227-233, 1991.
4. A. Haselbock. Exploiting interchangeabilities in constraint satisfaction problems. In IJCAI 93, pages 282-287, 1993.
5. T. Schiex and G. Verfaillie. Two approaches to the solution maintenance problem in dynamic constraint satisfaction problems, 1993.