Proceedings

Propagation Redundancy for Permutation Channels

Download BibTeX Cite

Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 1370-1370.

© 2003 International Joint Conferences on Artificial Intelligence

Abstract

  1. [Abdennadher and Rigotti, 2002] S. Abdennadher and C. Rigotti. Automatic generation of rule-based solvers for intentionally defined constraints. IJTAI, 11(2):283-302, 2002.
  2. K. Apt and E. Monfroy. Constraint programming viewed as rule-based programming. TPLP, I (6):713-750, 2001.
  3. [Cheng et al., 1999] B.M.W. Cheng, K.M.F. Choi, J.H.M. Lee, and J.C.K. Wu. Increasing constraint propagation by redundant modelling: an experience report. Constraints, 4(2):167-192, 1999.
  4. [Choi and Lee, 2002] C.W. Choi and J.H.M. Lee. On the pruning behaviour of minimal combined models for per- mutation CSPs. In International Workshop on Reformu- lating Constraint Satisfaction Problems, 2002.
  5. [Schulte and Stuckey, 2001] C. Schulte and P. J. Stuckey. When do bounds and domain propagation lead to the same search space. In PPDP 2001, pages 115-126,2001.
  6. [Smith, 2000] B. M. Smith. Modelling a permutation prob- lem. Research Report 2000.18, School of Computer Stud- ies, University of Leeds, 2000.
  7. [Walsh, 2001] T. Walsh. Permutation problems and chan- nelling constraints. In LPAR 2001, pages 377-391,2001 .
  8. [Gomes et al., 2002] C. Gomes and D. B. Shmoys. The promise of LP to Boost CSP Techniques for Combinato- rial Problems. In Proc. ofCPAIOR'02, Le Croisic, March 2002.
  9. [Gomes et al., 2002] C. Gomes and D. B. Shmoys. Com- pleting Quasi groups or Latin Squares: A Structured Graph Coloring Problem In Proc. Computational Symposium on Graph Coloring and Generalizations, 2002.
  10. [Walsh, 2001] T. Walsh. Permutation Problems and Chan- neling Constraints. TR 26, APES Group, 2001.
  11. [Colbourn, 1984] C. Colbourn. The complexity of complet- ing partial latin squares. In Discrete applied Mathematics, (8):25-30, 1984.
  12. [Cheng et al., 1996] B.M.W. Cheng, J.H.M. Lee, and J.C.K Wu. Speeding up constraint propagation by redundant modeling. In 2nd Int. Conf on Principles and Practice of Constraint Programming, pp. 91-103, 1996.
  13. [Bessiere, Regin, 1996] C.Bessiere and J.C.Regin Mac and combined heuristics: two reason to forsake FC (and CBJ?) on hard problemss. In CP'96, pp. 61-75, Cambridge MA.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards