Pruning by equally constrained variables

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

Volumn 3419 LNAI, Issue , 2005, Pages 26-40

  Razgon, Igor ^a   Meisels, Amnon ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS; CONSTRAINT THEORY; GRAPH THEORY; LOGIC PROGRAMMING;

CONSTRAINT NETWORK; PRUNING; SUBGRAPH ISOMORPHISM;

COMPUTER NETWORKS;

EID: 26844488184     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11402763_3     Document Type: Conference Paper

References (15)

1. A. Bulatov and P. Jeavons. An algebraic approach to multi-sorted constraints. In Principles and Practice of Constraint Programming-CP2003, pages 183-187, Kinsale, Ireland, oct 2003. Springer.
2. B. Choueiry and G. Noubir. On the computation of local interchangeability in discrete constraint satisfaction problems. In AAAI/IAAI, pages 326-333, 1998.
3. M. Cooper, D. Cohen, and P. Jeavons. Characterising tractable constraints. Artificial Intelligence, 65:347-361, 1994.
4. T. Fahle, S. Schamberger, and M. Sellmann. Symmetry breaking. In CP2001, pages 93-108. Springer, November 2001.
5. F. Focacci and M. Milano. Global cut framework for removing symmetries. In CP2001, pages 93-108. Springer, November 2001.
6. E.C. Freuder. Eliminating interchangeable values in constraint satisfaction problems. In AAAI 91, pages 227-233, 1991.
7. D. Frost and R. Dechter. Look-ahead value ordering for constraint satisfaction problems. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI'95, pages 572-578, Montreal, Canada, 1995.
8. R. M. Haralick and G.L. Elliott. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263-313, 1980.
9. P. Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9:268-299, 1993.
10. P. Prosser, Binary constraint satisfaction problems: some are harder than others. In ECAI-94, pages 95-99, Amsterdam, 1994.
11. J.-F. Puget. Symmetry breaking revisited. In CP2002, pages 446-462. Springer, September 2002.
12. T. Schiex and G. Verfaillie. Two approaches to the solution maintenance problem in dynamic constraint satisfaction problems. In Proc. of the IJCAI-93/SIGMAN Workshop on Knowledge-based Production Planning, Scheduling and Control, Chambery, France, (August 1993)., 1993.
13. T. Schiex and G. Verfaillie. Nogood Recording for Static and Dynamic Constraint Satisfaction Problem. International Journal of Artificial Intelligence Tools, 3(2):187-207, 1994.
14. P. van Beek. Constraint tightness and looseness versus local and global consistency. Journal of the ACM, 44(4):549-566, 1997.
15. R. Weigel and B. Faltings. Structuring techniques for constraint satisfaction problems. In Proceedings of the 15th International Joint Conference on Artificial Intelligence, pages 418-423, Nagoya, Japan, aug 1997. Morgan-Kaufmann.